Lexicographical order and duality in multiobjective programming

DOI10.1016/0377-2217(88)90178-6MaRDI QIDQ1104248zbMATH OpenOpenAlexWikidataFDO

Authors Juan-Enrique Martínez-Legaz

Publication date 1988

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(88)90178-6

zbMATH Keywords

duality theorylexicographical approachmultiple objective convex programmingPareto minima

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31)

Review text

Developed is a duality theory in multiple objective convex programming theory by using a lexicographical approach. The motivation of this is in extending some known results to problems which do not meet some regularity assumptions. The usual scalarization had to be replaced by nonnegative linear combinations with vector coefficients of the objectives, which permits to obtain all the Pareto minima. It should be noted that the methods employed in this paper could perhaps be applied in connection with other duality theories in multiobjective programming.

Recommendations

• Lagrangian duality for multiobjective programming problems in lexicographic order
• A dual-based algorithm for solving lexicographic multiple objective programs
• On a variant of lexicographic multi-objective programming
• Lexicographic optima in the multicriteria discrete optimization problem
• scientific article; zbMATH DE number 5159018
• scientific article; zbMATH DE number 992949
• scientific article; zbMATH DE number 3898622
• scientific article; zbMATH DE number 125284
• On the lexicographic centre of multiple objective optimization

Cites work

• A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
• Conjugate maps and duality in multiobjective optimization
• Duality and Alternative in Multiobjective Optimization
• Duality for Multiple Objective Convex Programs
• Duality in vector optimization
• Duality theory in multiobjective programming
• Exact quasiconvex conjugation
• Generalization of Fenchel's duality theorem for convex vector optimization
• scientific article; zbMATH DE number 3898622 (Why is no real title available?)
• scientific article; zbMATH DE number 3078986 (Why is no real title available?)
• Nonconvex Duality in Multiobjective Optimization
• On some relations between a dual pair of multiple objective linear programs
• Saddle points and duality in multi-objective programming

Cited in

(13)

• Lexicographic geometric programming
• Lexicographical separation in \({\mathbb{R}}^ n\)
• On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
• Lagrangian duality for multiobjective programming problems in lexicographic order
• General models in min-max continuous location: Theory and solution techniques
• scientific article; zbMATH DE number 3898622 (Why is no real title available?)
• Surrogate duality for vector optimization
• scientific article; zbMATH DE number 1163120 (Why is no real title available?)
• Characterizations of efficient solutions under polyhedrality assumptions
• On lexicographic vector equilibrium problems
• A dual-based algorithm for solving lexicographic multiple objective programs
• Lexicographical order, lexicographical index, and linear operators
• A minimax theorem for vector-valued functions in lexicographic order

This page was built for publication: Lexicographical order and duality in multiobjective programming

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