Die konvexe erweiterungsmethode-eine methode zur lösung diskreter optimierungsaufgaben

1 January 1975

journal article
research article
Published by Taylor & Francis in Mathematische Operationsforschung und Statistik

Vol. 6 (3) , 331-340
https://doi.org/10.1080/02331887508801219

Abstract

For a general discrete optimization problem a sufficient optimality condition is formulated. Starting with this condition a procedure is developped in order to solve the regarded problem. Tho finiteness of the procedure is proved. Furthermore, it is described, how this method can be epplied for the solution of mixed-integer linear optimization problems as well as for mixed linear zero-one problems.

Keywords

DIE KONVEXE
KONVEXE ERWEITERUNGSMETHODE
LSUNG DISKRETER
EINE METHODE
ZUR LSUNG
METHODE ZUR
ERWEITERUNGSMETHODE EINE

This publication has 1 reference indexed in Scilit:

Convex Analysis
Published by Walter de Gruyter GmbH ,1970