Saddle points and duality in multi-objective programming
From MaRDI portal
Cites work
- A duality theorem for a convex programming problem in order complete vector lattices
- A generalized saddlepoint theory. Its application to duality theory for linear vector optimum problems
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Duality theory in multiobjective programming
- Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
Cited in
(6)- Lexicographical order and duality in multiobjective programming
- scientific article; zbMATH DE number 3886629 (Why is no real title available?)
- scientific article; zbMATH DE number 3928745 (Why is no real title available?)
- Surrogate duality for vector optimization
- Efficiency Criteria and Duality Models for Multiobjective Fractional Programming Problems Containing Locall'y Subdifferentiable and ρ-Convex Functions
- Saddle point criteria and Wolfe duality in nonsmooth (Φ, ρ)-invex vector optimization problems with inequality and equality constraints
This page was built for publication: Saddle points and duality in multi-objective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948214)