The many facets of linear programming

DOI10.1007/S101070100261MaRDI QIDQ1849524zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael J. Todd

Publication date 1 December 2002

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070100261

zbMATH Keywords

interior-point methodssimplex methodellipsoid method

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Recommendations

• scientific article; zbMATH DE number 195106
• Linear programming -- a mathematical and algorithmic approach
• scientific article; zbMATH DE number 1786124
• scientific article; zbMATH DE number 47023
• scientific article; zbMATH DE number 4087415
• scientific article; zbMATH DE number 757651
• scientific article; zbMATH DE number 1168999
• scientific article; zbMATH DE number 3854804
• scientific article; zbMATH DE number 50649

Cited in

(32)

• Exploiting symmetries in polyhedral computations
• A strongly polynomial algorithm for linear systems having a binary solution
• Zonotopes and the LP-Newton method
• A polynomial projection algorithm for linear feasibility problems
• Dual-primal algorithm for linear optimization
• Some fundamental issues of basic line search algorithm for linear programming problems
• Polynomial time decision algorithms for probabilistic automata
• Constructing convex 3-polytopes from two triangulations of a polygon
• A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
• A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs
• Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems
• Algebraic simplex initialization combined with the nonfeasible basis method
• Book Review: The basic George B. Dantzig
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming
• Automatic verification of concurrent stochastic systems
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• Local base station assignment with time intervals in mobile computing environments
• On the length of monotone paths in polyhedra
• Transportation problems and simplicial polytopes that are not weakly vertex-decomposable
• On the Combinatorial Diameters of Parallel and Series Connections
• Obstructions to weak decomposability for simplicial polytopes
• An overview on the simplex algorithm
• Probabilistic satisfiability: algorithms with the presence and absence of a phase transition
• A nearly linear-time PTAS for explicit fractional packing and covering linear programs
• An interior-point algorithm for linear programming with optimal selection of centering parameter and step size
• Design of cross-directional controllers with optimal steady state performance
• Approximation schemes for packing with item fragmentation
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• A characterization theorem and an algorithm for a convex hull problem
• Constraint learning: an appetizer
• George B. Dantzig and systems optimization
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms

This page was built for publication: The many facets of linear programming

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