Convex analysis treated by linear programming

DOI10.1007/BF01584656zbMath0259.90032MaRDI QIDQ5675150

Richard J. Duffin

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05)

Related Items (19)

In a semi-infinite program only a countable subset of the constraints is essential ⋮ An additive eigenvalue problem of physics related to linear programming ⋮ Linear inequalities in mathematical programming and pattern recognition ⋮ Perfect duality in solving geometric programming problems under uncertainty ⋮ The limiting Lagrangian as a consequence of Helly's theorem ⋮ A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) ⋮ A limiting infisup theorem ⋮ Perfect duality for convexlike programs ⋮ A pathological semi-infinite program verifying Karlovitz's conjecture ⋮ On a classification scheme for geometric programming and complementarity theorems†^† ⋮ Constructing a perfect duality in infinite programming ⋮ A note on perfect duality and limiting lagrangeans ⋮ A simplified conjugation scheme for lower semi-continuous functions ⋮ Convex optimization and lagrange multipliers ⋮ Limiting Lagrangians: A primal approach ⋮ On duality in semi-infinite programming and existence theorems for linear inequalities ⋮ Strong duality for standard convex programs ⋮ Duality for convex infinite optimization on linear spaces ⋮ Classifying convex extremum problems over linear topologies having separation properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classifying convex extremum problems over linear topologies having separation properties
• Programmes in Paired Spaces
• An Infinite Linear Program with a Duality Gap
• An orthogonality theorem of dines related to moment problems and linear programming
• Symmetric Duality for Generalized Unconstrained Geometric Programming
• Linear Programming in Reflexive Spaces
• Linearizing Geometric Programs
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development

This page was built for publication: Convex analysis treated by linear programming