Strictly feasible solutions and strict complementarity in multiple objective linear optimization

DOI10.1007/S10288-016-0338-7MaRDI QIDQ1680765zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constraint qualificationdualityFarkas' lemmamultiple objective programmingprimal-dual weakly efficient solutionsstrictly complementary conditionsstrictly feasible points

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Duality theory and slackness conditions in multiobjective linear programming
• Multiobjective duality for convex-linear problems. II
• scientific article; zbMATH DE number 1594507
• Dualité en programmation linéaire multicritère
• A converse duality theorem in multiple objective programming

Cites work

• A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
• A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
• An efficient sampling approach to multiobjective optimization
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• Dominating sets for convex functions with some applications
• Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
• Duality theory and slackness conditions in multiobjective linear programming
• Duality theory for infinite-dimensional multiobjective linear programming
• Duality theory for the matrix linear programming problem
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• Epsilon-dominating solutions in mean-variance portfolio analysis
• Geometric Duality in Multiple Objective Linear Programming
• scientific article; zbMATH DE number 47208 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3308846 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• Linear and nonlinear programming.
• Linear programming. Foundations and extensions
• Multicriteria Optimization
• Multiobjective linear programming. An introduction
• On duality in multiple objective linear programming
• On some relations between a dual pair of multiple objective linear programs
• On the Minimization of Completion Time Variance with a Bicriteria Extension
• Planar point-objecitve location problems with nonconvex constraints: A geometrical construction
• 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
• Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm

Cited in

(1)

• The strict complementarity in linear fractional optimization

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)