Solving linear programming problems via linear minimax problems

DOI10.1016/0096-3003(91)90101-RMaRDI QIDQ1180710zbMATH OpenOpenAlexFDO

Authors Renpu Ge

Publication date 27 June 1992

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(91)90101-r

zbMATH Keywords

linear programmingnumerical examplesHouseholder transformationminimax problemmethod of weighted centers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Minimax linear programming problem
• New algorithms for linear programming
• Exact and stable least squares solution to the linear programming problem
• Linear programming by minimizing distances

Cites work

• A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
• A new polynomial-time algorithm for linear programming
• A penalty linear programming method using reduced-gradient basis-exchange techniques
• Linear Programming via a Nondifferentiable Penalty Function
• Linearly Constrained Discrete I ₁ Problems

Cited in

(4)

• Solving Max-min Relational Equations. Software and Applications
• Solving linear programming problems exactly
• Minimax linear programming problem
• Solving linear optimization over arithmetic constraint formula

This page was built for publication: Solving linear programming problems via linear minimax problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1180710)