The many facets of linear programming
From MaRDI portal
Publication:1849524
DOI10.1007/s101070100261zbMath1030.90051OpenAlexW2169287093WikidataQ55923390 ScholiaQ55923390MaRDI QIDQ1849524
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
Linear programming (90C05) Interior-point methods (90C51) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (32)
Local base station assignment with time intervals in mobile computing environments ⋮ Zonotopes and the LP-Newton method ⋮ Algebraic simplex initialization combined with the nonfeasible basis method ⋮ Automatic verification of concurrent stochastic systems ⋮ Obstructions to weak decomposability for simplicial polytopes ⋮ Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Constructing convex 3-polytopes from two triangulations of a polygon ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ A polynomial arc-search interior-point algorithm for linear programming ⋮ A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization ⋮ On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms ⋮ Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems ⋮ On the Combinatorial Diameters of Parallel and Series Connections ⋮ Probabilistic satisfiability: algorithms with the presence and absence of a phase transition ⋮ Approximation schemes for packing with item fragmentation ⋮ A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs ⋮ A nearly linear-time PTAS for explicit fractional packing and covering linear programs ⋮ Polynomial time decision algorithms for probabilistic automata ⋮ George B. Dantzig and systems optimization ⋮ Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming ⋮ Dual–primal algorithm for linear optimization ⋮ A strongly polynomial algorithm for linear systems having a binary solution ⋮ Some fundamental issues of basic line search algorithm for linear programming problems ⋮ Design of cross-directional controllers with optimal steady state performance ⋮ A polynomial projection algorithm for linear feasibility problems ⋮ An overview on the simplex algorithm ⋮ An interior-point algorithm for linear programming with optimal selection of centering parameter and step size ⋮ Book Review: The basic George B. Dantzig ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ On the Length of Monotone Paths in Polyhedra ⋮ A characterization theorem and an algorithm for a convex hull problem
This page was built for publication: The many facets of linear programming
