New Sufficient Optimality Conditions for Integer Programming and Their Application

Simple item page
dc.contributor.authorFleisher, J. M.en_US
dc.contributor.authorMeyer, R. R.en_US
dc.date.accessioned2012-03-15T16:26:34Z
dc.date.available2012-03-15T16:26:34Z
dc.date.created1976en_US
dc.date.issued1976en
dc.description.abstractThe 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 a generalizations of optimality conditions based on primal-dual complementarity in linear programming, and 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR278en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57998
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleNew Sufficient Optimality Conditions for Integer Programming and Their Applicationen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR278.pdf
Size:
1.27 MB
Format:
Adobe Portable Document Format
Download

Collections

CS Technical Reports