Duality for algebraic linear programming
From MaRDI portal
Publication:1142711
DOI10.1016/0024-3795(80)90004-XzbMath0439.90097WikidataQ114852117 ScholiaQ114852117MaRDI QIDQ1142711
Publication date: 1980
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
dualityoptimality criteriaprimal simplex methodalgebraic linear programmingmonotone semimodulestrong duality results
Related Items
Max-balanced flows in oriented matroids ⋮ On the bottleneck linear programming problem ⋮ Characterizations of max-balanced flows ⋮ An analogue of Hoffman's circulation conditions for max-balanced flows ⋮ An out-of-kilter method for the algebraic circulation problem ⋮ On abstract duality in mathematical programming
Cites Work
- A generalized Hungarian method for solving minimum weight perfect matching problems with algebraic objective
- An augmenting path method for solving linear bottleneck assignment problems
- A general Hungarian method for the algebraic transportation problem
- Weakly admissible transformations for solving algebraic assignment and transportation problems
- Bottleneck Linear Programming
- Bottleneck linear programming
- An algebraic approach to assignment problems
- On abstract dual linear programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item