Solving linear programming problems via linear minimax problems

DOI10.1016/0096-3003(91)90101-RzbMath0745.65041OpenAlexW2020258228MaRDI QIDQ1180710

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 examplesminimax problemHouseholder transformationmethod of weighted centers

Mathematics Subject Classification ID

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

Cites Work

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

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