Strong duality for infinite-dimensional vector-valued programming problems
Let X, Y, and Z be locally convex real topological vector spaces, \(A\subset X\) a convex subset, and let \(C\subset Y\), \(E\subset Z\) be cones. Let f: \(X\to Z\) be E-concave and g: \(X\to Y\) be C-concave functions. We consider a concave programming problem with respect to an abstract cone and its strong dual problem as follows: \[ (P)\quad \max imize\quad f(x),\quad subject\quad to\quad x\in A,\quad g(x)\in C, \] \[ (SD)\quad \min imize\quad \{\cup_{\phi \in C\quad +}\max \{(f+\phi \circ g)(A):\quad E\}\}, \] where C \(+\) denotes the set of all nonnegative continuous linear operators from Y to Z and (SD) is the strong dual problem to (P). The authors find a necessary condition of strong saddle point for Problem (P) and establish the strong duality relationships between Problems (P) and (SD).
- Strong duality for generalized monotropic programming in infinite dimensions
- On linear vector optimization duality in infinite-dimensional spaces
- Duality in infinite dimensional linear programming
- Strong duality for inexact linear programming
- scientific article; zbMATH DE number 3986031
- Duality for semi-definite and semi-infinite programming
- scientific article; zbMATH DE number 592647
- scientific article; zbMATH DE number 3936963
- scientific article; zbMATH DE number 6154382
- scientific article; zbMATH DE number 894761
- A course on optimization and best approximation
- A duality theorem for a convex programming problem in order complete vector lattices
- An existence result for maximizations with respect to cones
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Conjugate maps and duality in multiobjective optimization
- Duality theory for maximizations with respect to cones
- Duality theory in multiobjective programming
- Efficiency in multiple objective optimization problems
- Existence Theorems for Pareto Optimization; Multivalued and Banach Space Valued Functionals
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Lagrangean conditions and quasiduality
- Maximal vectors and multi-objective optimization
- Nonlinear programming in locally convex spaces
- Optimization theory in linear spaces. I
- Proper Efficient Points for Maximizations with Respect to Cones
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
- Weak Tangent Cones and Optimization in a Banach Space
- Duality for a minimax programming problem containing n-set functions
- Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
- Strong duality for generalized monotropic programming in infinite dimensions
- On duality in the vectorial control-approximation problem
- A hahn-banach theorem in ordered linear spaces and its applications
- A dual problem for convex programming in ordered vector spaces
This page was built for publication: Strong duality for infinite-dimensional vector-valued programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108942)
