On the uniqueness of solutions to linear programs

Journal of the Operational Research Society

Volumn 53, Issue 10 SPEC., 2002, Pages 1127-1132

  Appa, G ^a  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

Author keywords

Degeneracy; Linear programming; Multiple solutions; Stable solutions in MCDM; Unique solutions

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DATA STRUCTURES; DECISION MAKING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

MULTI-CRITERIA DECISION MAKING (MCDM);

LINEAR PROGRAMMING;

EID: 0036790081     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601320     Document Type: Article

References (14)

1. Jacquet-Lagreze E. and Siskos J. (1982). Assessing a set of additive utility functions for multicriteria decision-making, the UTA method. Eur J Opl Res 10: 151-164.
2. Siskos Y., Grigoroudis E., Zopounidis C. and Saurais O. (1998). Measuring customer satisfaction using a collective preference disaggregation model. Global Optim 12: 175-185.
3. Appa G.M. and Kotnyek B. (2000). Binet Matrices, an extension of network matrices. CDAM Research Report Series LSE-CDAM-2000-19, Centre for Discrete and Applicable Mathematics, LSE, WC2A 2AE, U.K. Also available from http://www.cdam.lse.ac.uk.
4. Williams H.P. (1999). Model Building in Mathematical Programming, 3d edn. Wiley: Chichester.
5. Hillier F.S. and Lieberman G.J. (1985). Operations Research. Holden-Day: San Francisco.
6. Mangasarian O.L. (1979). Uniqueness of solutions in linear programming. Linear Algebra Appl 25: 151-162.
7. Tijssen G.A. and Sierksma G. (1998). Balinski-Tucker simplex tableaus: dimensions, degeneracy degrees, and interior points of optimal faces. Math Program 81: 349-372.
8. Kantor I.L. (1993). Description of the optimal solution set of the linear programming problem and the dimension formula. Linear Algebra Appl 179: 19-32.
9. Nering E.D. and Tucker A.W. (1993). Linear Programming and Related Problems. Academic Press: New York.
10. Bakshiyan B.T.S., Matasov A.I. and Fedayev K.S. (2000). On the solution of degenerate problems of linear programming. Autom Remote Control 61(1, Part 2): 98-110. (Translated from Telemekhanika 1: 105-117.).
11. Bakshiyan B.T.S., Matasov A.I. and Fedayev K.S. (2000). On the solution of degenerate problems of linear programming. Autom Remote Control 61(1, Part 2): 98-110. (Translated from Telemekhanika 1: 105-117.).
12. Balinski M.L. and Gomory R.E. (1963). A mutual primal-dual simplex method. In: Graves S.C. and Wolfe P. (eds). Recent Advances in Mathematical Programming McGraw-Hill: New York, pp 17-37.
13. Appa G.M. (1979). Contributions to mathematical programming. PhD thesis, London University.
14. Nemhauser G.L. and Wolsey L.A. (1988). Integer and Combinatorial Optimization. Wiley Interscience: New York.