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