ISSN:
1436-4646
Schlagwort(e):
Parametric Linear Programming
;
Construction Method
;
Degeneracy
;
Primal Lexicographic Method
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract We consider a linear programming problem, with two parameters in the objective function, and present an algorithm for finding the decomposition of the parameter space into maximal polyhedral areas in which particular basic solutions are optimal. Special attention is paid to fill up areas of degenerate solutions.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01582092