Duality theorems and algorithms for linear programming in measure spaces

DOI10.1007/s10898-004-8274-zzbMath1066.90068OpenAlexW2004078937MaRDI QIDQ1777445

Niranjan Chakravarthy

Publication date: 17 May 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-8274-z

zbMATH Keywords

linear programmingduality theory

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Programming in abstract spaces (90C48)

Related Items (1)

Exact relaxations of non-convex variational problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of duality theory for linear programming over topological vector spaces
• Measure theoretic versions of linear programming
• Extremal points and optimal solutions for general capacity problems
• Relaxed cutting plane method for solving linear semi-infinite programming problems
• Semi-Infinite Programming: Theory, Methods, and Applications
• Programmes in Paired Spaces
• On Linear Semi-Infinite Programming Problems: An Algorithm
• Linear programming in measure spaces

This page was built for publication: Duality theorems and algorithms for linear programming in measure spaces