Linear optimization and extensions

zbMath0839.90082MaRDI QIDQ1892405

Manfred W. Padberg

Publication date: 14 June 1995

Published in: Algorithms and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

textbook; linear optimization; ellipsoid algorithms; simplex algorithms; blocking and antiblocking polyhedra; post optimality

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C11: Mixed integer programming

90C05: Linear programming

90C27: Combinatorial optimization

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression, Observability in linear systems of equations and inequalities: Applications, Extreme points of coherent probabilities in finite spaces, Some lower bounds for the complexity of the linear programming feasibility problem over the reals, Order preserving assignments without contiguity, An analytic symmetrization of max flow-min cut, Combinatorial optimization: current successes and directions for the future, Obtaining simultaneous solutions of linear subsystems of inequalities and duals, Alternative methods of linear regression, Team formation: Matching quality supply and quality demand., Combinatorial optimization and small polytopes, Least trimmed squares regression, least median squares regression, and mathematical program\-ming, Dealing with the multiplicity of solutions of the \(\ell _{1}\) and \(\ell _{\infty }\) regression models, Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms