On Computing an Initial Efficient Extreme Point

DOI10.2307/3009475MaRDI QIDQ4166597zbMATH OpenOpenAlexFDO

Authors J. G. Ecker, N. S. Hegner

Publication date 1978

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3009475

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31)

Cited in

(12)

• Solving bilevel linear programs using multiple objective linear programming
• Optimization over the efficient set using an active constraint approach
• Complete efficiency and the initialization of algorithms for multiple objective programming
• Optimizing a linear function over an efficient set
• A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
• Efficiency analysis, generating an efficient extreme point for an MOLP, and some comparisons
• Finding a weights-restricted efficient (extreme) point and using it for solving MOLP problems.
• The range of the efficient frontier in multiple objective linear programming
• Generation of efficient and ε -efficient solutions in multiple objective linear programming
• A discussion of scalarization techniques for multiple objective integer programming
• Finding all maximal efficient faces in multiobjective linear programming
• Optimization over the efficient set of a parametric multiple objective linear programming problem

This page was built for publication: On Computing an Initial Efficient Extreme Point

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166597)