Duality for algebraic linear programming

DOI10.1016/0024-3795(80)90004-XzbMath0439.90097WikidataQ114852117 ScholiaQ114852117MaRDI QIDQ1142711

Uwe T. Zimmermann

Publication date: 1980

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

duality; optimality criteria; primal simplex method; algebraic linear programming; monotone semimodule; strong duality results

Mathematics Subject Classification ID

90C05: Linear programming

20M14: Commutative semigroups

90C48: Programming in abstract spaces

Related Items

An out-of-kilter method for the algebraic circulation problem, On the bottleneck linear programming problem, Characterizations of max-balanced flows, Max-balanced flows in oriented matroids, An analogue of Hoffman's circulation conditions for max-balanced flows, 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