The range of the efficient frontier in multiple objective linear programming
From MaRDI portal
efficiencymultiple objective linear programmingparametric quadratic programmingrange of the efficient frontierWolfe's algorithm
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Cites work
- A general method for determining the set of all efficient solutions to a linear vectormaximum problem
- Generating all maximal efficient faces for multiple objective linear programs
- scientific article; zbMATH DE number 3743036 (Why is no real title available?)
- scientific article; zbMATH DE number 3788378 (Why is no real title available?)
- scientific article; zbMATH DE number 3543799 (Why is no real title available?)
- scientific article; zbMATH DE number 3630504 (Why is no real title available?)
- scientific article; zbMATH DE number 3356433 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- On Computing an Initial Efficient Extreme Point
- Proper efficiency and the theory of vector maximization
- Solving Bicriterion Mathematical Programs
- Stability in convex quadratic parametric programming
- The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
- The Nucleolus as a Solution of a Minimization Problem
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The Simplex Method for Quadratic Programming
- The structure of admissible points with respect to cone dominance
Cited in
(5)
This page was built for publication: The range of the efficient frontier in multiple objective linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3040942)
