Sensitivity analysis of multiobjective linear programming from a geometric perspective
From MaRDI portal
Cites work
- A new geometric approach for sensitivity analysis in linear programming
- A new geometric approach to multiobjective linear programming problems
- A revised simplex method for linear multiple objective programs
- Algorithms for the vector maximization problem
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Fuzzy multiple objective decision making. Methods and applications
- Fuzzy programming and linear programming with several objective functions
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3523317 (Why is no real title available?)
- Linear Multiparametric Programming by Multicriteria Simplex Method
- Multiparametric Linear Programming
- Multiple Objective Linear Programming with Interval Criterion Weights
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Problems and methods with multiple objective functions
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
- The Tolerance Approach to Sensitivity Analysis in Linear Programming
- Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis
This page was built for publication: Sensitivity analysis of multiobjective linear programming from a geometric perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6905910)