New sufficient optimality conditions for integer programming and their application

Autor:	R. R. Meyer, J. M. Fleisher
Rok vydání:	1978
Předmět:	Mathematical optimization Karush–Kuhn–Tucker conditions General Computer Science Linear programming Branch and price Greatest common divisor Benchmark (computing) Integer points in convex polyhedra Integer programming Branch and cut Mathematics
Zdroj:	Communications of the ACM. 21:411-418
ISSN:	1557-7317 0001-0782
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::37323f60287d7cfa507b2959cfe39cb2 https://doi.org/10.1145/359488.359504 Zobrazit plný text záznamu