Theory and algorithms for linear multiple objective programs with zero–one variables
Author:
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 362-390
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Finding all efficient extreme points for multiple objective linear programsMathematical Programming, 1978
- Linear multiple objective programs with zero–one variablesMathematical Programming, 1977
- Integer Linear Programming with Multiple Objectives1977
- Multiple Criteria Public Investment Decision Making by Mixed Integer Programming1976
- The set of all nondominated solutions in linear cases and a multicriteria simplex methodJournal of Mathematical Analysis and Applications, 1975
- A revised simplex method for linear multiple objective programsMathematical Programming, 1973
- Algorithms for the vector maximization problemMathematical Programming, 1972
- Convex Analysis1970