Strictly feasible solutions and strict complementarity in multiple objective linear optimization
DOI10.1007/S10288-016-0338-7zbMATH Open1374.90342OpenAlexW2564641171MaRDI QIDQ1680765FDOQ1680765
Authors: Nezam Mahdavi-Amiri, Farzad Salehisadaghiani 
Publication date: 16 November 2017
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-016-0338-7
Recommendations
dualitymultiple objective programmingconstraint qualificationFarkas' lemmaprimal-dual weakly efficient solutionsstrictly complementary conditionsstrictly feasible points
Linear programming (90C05) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear and nonlinear programming.
- Title not available (Why is that?)
- Multicriteria Optimization
- Title not available (Why is that?)
- Dominating sets for convex functions with some applications
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- Geometric Duality in Multiple Objective Linear Programming
- Epsilon-dominating solutions in mean-variance portfolio analysis
- An efficient sampling approach to multiobjective optimization
- Title not available (Why is that?)
- On some relations between a dual pair of multiple objective linear programs
- Linear programming. Foundations and extensions
- Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
- Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
- Duality theory for the matrix linear programming problem
- A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
- On duality in multiple objective linear programming
- Set-valued duality theory for multiple objective linear programs and application to mathematical finance
- Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
- Multiobjective linear programming. An introduction
- Duality theory for infinite-dimensional multiobjective linear programming
- Duality theory and slackness conditions in multiobjective linear programming
- Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
Cited In (1)
This page was built for publication: Strictly feasible solutions and strict complementarity in multiple objective linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1680765)
