Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems


subject to A X = b and that,X is an extreme point of DX=d, X>O, is developed. The procedure will avoid the investigation of many of the extreme points of DX = d, X > 0 and also alternative optimas of different best extreme points of DX = d, X >_ 0 will not be needed. The algorithm is expected to work very efficiently. Zusammenfassung: In dieser Arbeit… (More)
DOI: 10.1007/BF01956854


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics