A general approach for studying duality in multiobjective optimization
From MaRDI portal
Publication:2460035
DOI10.1007/S00186-006-0125-XzbMath1168.90604OpenAlexW1978039574MaRDI QIDQ2460035
Radu Ioan Boţ, Sorin-Mihai Grad, Gert Wanka
Publication date: 14 November 2007
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0125-x
Convex programming (90C25) Multi-objective and goal programming (90C29) Derivative-free methods and methods using generalized derivatives (90C56) Duality theory (optimization) (49N15)
Related Items (6)
A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ New representations of epigraphs of conjugate mappings and Lagrange, Fenchel–Lagrange duality for vector optimization problems ⋮ Global solution of constrained min-max problems with inflationary differential evolution ⋮ Some properties of nonconvex oriented distance function and applications to vector optimization problems ⋮ Duality in nonconvex vector optimization ⋮ Duality for vector optimization problems via a general scalarization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scalarization and nonlinear scalar duality for vector optimization with preferences that are not necessarily a pre-order relation
- Nonconvex separation theorems and some applications in vector optimization
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Duality for location problems with unbounded unit balls
- Theory of multiobjective optimization
- Über die Skalarisierung und Dualisierung von Vektoroptimierungsproblemen. (Scalarization and dualization of vector optimization problems)
- Generalized goal programming: polynomial methods and applications
- Multiobjective duality for convex-linear problems. II
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Norm-based approximation in multicriteria programming.
- Multiobjective duality for convex semidefinite programming problems
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Scalarization and stability in vector optimization
- Fenchel-Lagrange duality versus geometric duality in convex optimization
- New constraint qualification and conjugate duality for composed convex optimization problems
- Scalarization in vector optimization
- A Multiobjective Diet Planning Support System Using the Satisficing Trade-off Method
- Degrees of Efficiency and Degrees of Minimality
- Optimality Conditions via Norm Scalarization in Vector Optimization
- An analysis of some dual problems in multiobjective optimization (I)
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Convex Analysis
- OLAF -- a general modeling system to evaluate and optimize the location of an air polluting facility
This page was built for publication: A general approach for studying duality in multiobjective optimization
