Saddle points and scalarizing sets in multiple objective linear programming

DOI10.1007/s00186-014-0467-8zbMath1311.90134OpenAlexW2020252434MaRDI QIDQ406635

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)

Related Items (1)

Some saddle-point theorems for vector-valued functions

Cites Work

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

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