Saddle points and scalarizing sets in multiple objective linear programming

DOI10.1007/S00186-014-0467-8zbMATH Open1311.90134OpenAlexW2020252434MaRDI QIDQ406635FDOQ406635

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

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

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)

Cites Work

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

Cited In (6)

• Saddlepoints in group and semigroup minimization
• Some saddle-point theorems for vector-valued functions
• Title not available (Why is that?)
• Generalized saddle points in multi-objective bilinear programming
• Relaxations and duality for multiobjective integer programming
• 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)