Generation of efficient and ε -efficient solutions in multiple objective linear programming
From MaRDI portal
Publication:4634220
DOI10.3906/mat-1702-12zbMath1424.90184OpenAlexW4252769901MaRDI QIDQ4634220
Sonia Radjef, Zohra Sabrina Delhoum, Fatima Boudaoud
Publication date: 7 May 2019
Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1702-12
efficiencyadaptive methodweak efficiencybounded variables\(\epsilon\)-efficiencymulti-objective linear program\(\epsilon\)-optimality criterion
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Linear programming (90C05)
Related Items (2)
The set of all the possible compromises of a multi-level multi-objective linear programming problem ⋮ Unnamed Item
Cites Work
- Unnamed Item
- A new algorithm for linear multiobjective programming problems with bounded variables
- An effective generalization of the direct support method
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Multiple criteria decision analysis. State of the art surveys
- On Computing an Initial Efficient Extreme Point
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Linear programming with multiple objective functions: Step method (stem)
This page was built for publication: Generation of efficient and ε -efficient solutions in multiple objective linear programming