Parametric Integer Programming: The Right-Hand-Side-Case
Name
OR-050-76.pdf
Size
1.13 MB
Format
Adobe PDF
Checksum (MD5)
37eb4055bdae69348cbe0533a347ceff
Author(s)
Marsten, Roy E.
Morin, Thomas L.
Date Issued
March 1976
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 050-76
Abstract
A family of integer programs is considered whose right-hand-sides lie on a given line segment L. This family is called a parametric integer program(PIP). Solving a (PIP) means finding an optimal solution for every program in the family. It is shown how a simple generalization of the conventional branch-and-bound approach to integer programming makes it possible to solve such a (PIP). The usual bounding test is extended from a comparison of two point values to a comparison of two functions defined on the line segment L. The method is illustrated on a small example and computational results for some larger problems are reported.
MIT Department
Massachusetts Institute of Technology. Operations Research Center
Persistent DSpace Link
