Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Quantitative Aspekte der Strategischen Planung im Unternemen Read chapter Read first chapter

1984 | OriginalPaper | Chapter

On Using the Linear Programming Relaxation of Assignment Type Mixed Integer Problems

Authors : Jo van Nunen, Jacq Benders, Adri Beulens

Published in: DGOR

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

It can be proved, that tight upperbounds can be given for the number of non-unique assignments that are achieved after solving the linear programming relaxation of some types of mixed integer assignment problems. A simple heuristic can then be used to reach a practically good and feasible assignment.

previous chapter An Optimum Pulse Width Modulation Based on 0–1 Programming for Harmonic Reduction
next chapter Langfristige Abbauplanung Im Steinkohlentiefbau Mit Hilfe Eines Branch and Bound Verfahrens
Metadata
Title
On Using the Linear Programming Relaxation of Assignment Type Mixed Integer Problems
Authors
Jo van Nunen
Jacq Benders
Adri Beulens
Copyright Year
1984
Publisher
Springer Berlin Heidelberg
Book
DGOR

Print ISBN: 978-3-540-13134-2

Electronic ISBN: 978-3-642-69546-9

Copyright Year: 1984

DOI
https://doi.org/10.1007/978-3-642-69546-9_65

Premium Partner

    Image Credits