New sufficient optimality conditions for integer programming and their application

Authors:
J. M. Fleisher;R. R. Meyer
Affiliations:
Univ. of Wisconsin-Madison, Madison, WI;Univ. of Wisconsin-Madison, Madison, WI
Venue:
Communications of the ACM
Year:
1978

Citing 2
Cited 0

Algorithm and bound for the greatest common divisor of n integers

Communications of the ACM
Pracniques: construction of nonlinear programming test problems

Communications of the ACM

Quantified Score

Hi-index	48.22

Visualization

Abstract

The purpose of this report is to present a new class of sufficient optimality conditions for pure and mixed integer programming problems. Some of the sets of sufficient conditions presented can be thought of as generalizations of optimality conditions based on primal-dual complementarity in linear programming. These sufficient conditions are particularly useful for the construction of difficult integer programming problems with known optimal solutions. These problems may then be used to test and/or “benchmark” integer programming codes.