Random problem generation and the computation of efficient extreme points in multiple objective linear programming
- 1 October 1994
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 3 (4) , 333-347
- https://doi.org/10.1007/bf01299208
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Determination of the efficient set in multiobjective linear programmingJournal of Optimization Theory and Applications, 1991
- Computational experience concerning payoff tables and minimum criterion values over the efficient setEuropean Journal of Operational Research, 1988
- Reminiscences about the origins of linear programmingOperations Research Letters, 1982
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective ProgramJournal of the Operational Research Society, 1981
- Generating all maximal efficient faces for multiple objective linear programsJournal of Optimization Theory and Applications, 1980
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective ProgramJournal of the Operational Research Society, 1977
- A revised simplex method for linear multiple objective programsMathematical Programming, 1973
- Algorithms for the vector maximization problemMathematical Programming, 1972
- Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalitiesUSSR Computational Mathematics and Mathematical Physics, 1965