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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
T. Gal,Betriebliche Entscheidungdprobleme, Sensitivitätsanalyse und parametrische Programmierung (Walter de Bruyn, Berlin, 1973).
R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, 1970).
R.G. Busacker and T.L. Saaty,Finite graphs and networks: An introduction with applications (McGraw-Hill, New York, 1965).
B. Grünbaum,Convex polytopes (Wiley, London, 1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klein Haneveld, W.K., van der Meer, C.L.J. & Peters, R.J. A construction method in parametric programming. Mathematical Programming 16, 21–36 (1979). https://doi.org/10.1007/BF01582092
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582092