The many facets of linear programming
From MaRDI portal
Publication:1849524
DOI10.1007/s101070100261zbMath1030.90051WikidataQ55923390 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
90C05: Linear programming
90C51: Interior-point methods
01A60: History of mathematics in the 20th century
90-03: History of operations research and mathematical programming
Related Items
Dual–primal algorithm for linear optimization, Book Review: The basic George B. Dantzig, Algebraic simplex initialization combined with the nonfeasible basis method, A polynomial arc-search interior-point algorithm for linear programming, 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, Constructing convex 3-polytopes from two triangulations of a polygon, A strongly polynomial algorithm for linear systems having a binary solution, A polynomial projection algorithm for linear feasibility problems, Zonotopes and the LP-Newton method, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Constraint optimal selection techniques (COSTs) for nonnegative linear programming problems, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Approximation schemes for packing with item fragmentation, George B. Dantzig and systems optimization, An overview on the simplex algorithm, Local base station assignment with time intervals in mobile computing environments, A characterization theorem and an algorithm for a convex hull problem, Design of cross-directional controllers with optimal steady state performance, Exploiting Symmetries in Polyhedral Computations, Transportation Problems and Simplicial Polytopes That Are Not Weakly Vertex-Decomposable, Computing Behavioral Relations for Probabilistic Concurrent Systems, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, Some fundamental issues of basic line search algorithm for linear programming problems, Obstructions to weak decomposability for simplicial polytopes
