Duality theorems and algorithms for linear programming in measure spaces
From MaRDI portal
(Redirected from Publication:1777445)
Recommendations
Cites work
- scientific article; zbMATH DE number 3909079 (Why is no real title available?)
- scientific article; zbMATH DE number 1186924 (Why is no real title available?)
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3286659 (Why is no real title available?)
- 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
- Measure theoretic versions of linear programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Programmes in Paired Spaces
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
Cited in
(6)- A review of duality theory for linear programming over topological vector spaces
- Dual Linear Programming Problem and One-Dimensional Gromov Minimal Fillings of Finite Metric Spaces
- Differential-algebraic approach to linear programming
- Exact relaxations of non-convex variational problems
- Linear programming in measure spaces
- An Approximation Approach for Linear Programming in Measure Space
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)