Open AccessTechnical Note—Equivalent Mixed Integer Programming Problems
Author(s) -
Gordon H. Bradley
Publication year - 1973
Publication title -
operations research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.797
H-Index - 140
eISSN - 1526-5463
pISSN - 0030-364X
DOI - 10.1287/opre.21.1.323
Subject(s) - integer programming , mathematics , equivalence (formal languages) , mathematical optimization , class (philosophy) , integer (computer science) , hermite polynomials , computer science , discrete mathematics , pure mathematics , artificial intelligence , programming language
Every mixed integer programming problem is shown to be equivalent to an infinite number of other mixed integer programming problems. The optimal solution to any problem in a class determines the optimal solution to every other problem in the class. Canonical problems existing in every equivalence class may be solved in lieu of the original problem. For problems with rational data, the mixed Hermite canonical problem is introduced. A numerical example is included.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom