Duality theorems and algorithms for linear programming in measure spaces
From MaRDI portal
Publication:1777445
DOI10.1007/S10898-004-8274-ZzbMATH Open1066.90068OpenAlexW2004078937MaRDI QIDQ1777445FDOQ1777445
Authors: 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
Recommendations
Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Semi-Infinite Programming: Theory, Methods, and Applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Measure theoretic versions of linear programming
- Programmes in Paired Spaces
- Title not available (Why is that?)
- A review of duality theory for linear programming over topological vector spaces
- Extremal points and optimal solutions for general capacity problems
- Linear programming in measure spaces
Cited In (6)
- Exact relaxations of non-convex variational problems
- Differential-algebraic approach to linear programming
- Linear programming in measure spaces
- An Approximation Approach for Linear Programming in Measure Space
- Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
- A review of duality theory for linear programming over topological vector spaces
This page was built for publication: Duality theorems and algorithms for linear programming in measure spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777445)
