Saddle points and scalarizing sets in multiple objective linear programming

DOI10.1007/S00186-014-0467-8MaRDI QIDQ406635zbMATH OpenOpenAlexFDO

Authors Daniel Gourion, Dinh The Luc

Publication date 8 September 2014

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00186-014-0467-8

zbMATH Keywords

dualitysaddle pointmultiple objective linear problemscalarizing setvector Lagrangian function

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• Saddle points and Pareto points in multiple objective programming
• Saddle point and generalized convex duality for multiobjective programming.
• Lagrange multipliers and saddle points in multiobjective programming
• scientific article; zbMATH DE number 4133827
• scientific article; zbMATH DE number 123896

Cites work

• scientific article; zbMATH DE number 1017537 (Why is no real title available?)
• scientific article; zbMATH DE number 2063780 (Why is no real title available?)
• scientific article; zbMATH DE number 2156773 (Why is no real title available?)
• scientific article; zbMATH DE number 3373921 (Why is no real title available?)
• scientific article; zbMATH DE number 3078984 (Why is no real title available?)
• A characterization of generalized saddle points for vector-valued functions via scalarization
• A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
• A minimax theorem for vector-valued functions
• A minimax theorem for vector-valued functions. II
• A saddlepoint theorem for set-valued maps
• Abstract convexity and global optimization
• Axiomatic approach to duality in optimization
• Classical linear vector optimization duality revisited
• DEMICONTINUITY, GENERALIZED CONVEXITY AND LOOSE SADDLE POINTS OF SET-VALUED MAPS
• Determination of the efficient set in multiobjective linear programming
• Duality in Vector Optimization
• Duality theory for the matrix linear programming problem
• Generalized semicontinuity and existence theorems for cone saddle points
• Loose saddle points of set-valued maps in topological vector spaces
• Normal cone method in solving linear multiobjective problems
• On duality in multiple objective linear programming
• Saddle points and minimax theorems for vector-valued multifunctions on \(H\)-spaces
• Selecting Subsets from the Set of Nondominated Vectors in Multiple Objective Linear Programming
• Some minimax theorems in vector-valued functions
• The strong minimax theorem and strong saddle points of vector-valued functions
• Theory of multiobjective optimization

Cited in

(6)

• Generalized saddle points in multi-objective bilinear programming
• Some saddle-point theorems for vector-valued functions
• Relaxations and duality for multiobjective integer programming
• Saddlepoints in group and semigroup minimization
• scientific article; zbMATH DE number 2159098 (Why is no real title available?)
• Saddle points and Pareto points in multiple objective programming

This page was built for publication: Saddle points and scalarizing sets in multiple objective linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q406635)