A dual problem for convex programming in ordered vector spaces

DOI10.1080/02331939008843553zbMath0725.90096OpenAlexW2091651049MaRDI QIDQ5202861

Li Shizheng

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843553

zbMATH Keywords

dual problemconverse dualitystrong dualityordered vector spacesconvex vector optimizationconvex operators

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Cites Work

• Unnamed Item
• The saddle point theorem of Kuhn and Tucker in ordered vector spaces
• A subgradient duality theorem
• Saddlepoints for convex programming in order vector spaces
• Duality for Multiple Objective Convex Programs
• Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces
• Convex Analysis

This page was built for publication: A dual problem for convex programming in ordered vector spaces