A New Class of Sufficient Optimality Conditions for Integer Programming

Simple item page
dc.contributor.authorFleisher, J.M.en_US
dc.contributor.authorMeyer, R.R.en_US
dc.date.accessioned2012-03-15T16:25:21Z
dc.date.available2012-03-15T16:25:21Z
dc.date.created1975en_US
dc.date.issued1975en
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 as 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 test problems with known optimal solutions.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR248en
dc.identifier.urihttp://digital.library.wisc.edu/1793/57938
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleA New Class of Sufficient Optimality Conditions for Integer Programmingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

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

Collections

CS Technical Reports