Linear programming. Foundations and extensions

zbMath0899.90129MaRDI QIDQ5906270

Robert J. Vanderbei

Publication date: 16 September 1998

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

zbMATH Keywords

constrained optimizationconvex analysis

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (8)

Tight performance bounds in the worst-case analysis of feed-forward networks ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Unnamed Item ⋮ Two-phase simplex method for linear semidefinite optimization ⋮ A polynomial-time algorithm for linear optimization based on a new class of kernel functions ⋮ Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion ⋮ Generalized affine scaling algorithms for linear programming problems

This page was built for publication: Linear programming. Foundations and extensions