Linear Multiparametric Programming by Multicriteria Simplex Method

P. L. Yuf and M. Zeleny
Additional contact information
P. L. Yuf: University of Texas
M. Zeleny: Columbia University

Management Science, 1976, vol. 23, issue 2, 159-170

Abstract: A recently derived Multicriteria Simplex Method [Yu, P. L., M. Zeleny. 1975. The set of all nondominated solutions in linear cases and a multicriteria simplex method. J. Math. Anal. Appl. 49 (2, February) 430-468.] is used to study some basic properties in the decomposition of parametric space. A new type of parametric space, which arises naturally in its formulation, is used. Two computational methods are discussed. The first one is an indirect algebraic method which locates the corresponding set of all nondominated extreme points. The second one is a direct geometric decomposition method which is similar to that discussed by Gal and Nedoma [Gal, T., J. Nedoma. 1972 Multiparametric linear programming. Management Sci.. 18 406-421.]. The difficulties of such a geometric method are discussed through an example.

Date: 1976
References: Add references at CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.23.2.159 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:23:y:1976:i:2:p:159-170

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().