Linear programming 2: Theory and extensions

By D. Griffel. 2004

346 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Numerical Analysis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Control and Systems Engineering

1. Romain Laroche
2. Michal Pióro
3. D. Medhi

In Numerical Analysis

1. Romain Laroche
2. Michal Pióro
3. D. Medhi

Citations in the corpus

• Safe Policy Improvement with Soft Baseline Bootstrapping (2019, background): “…computational complexity of the simplex is exponential in the dimensions of the program being solved (Klee and Minty, 1972), this algorithm is efficient in practice: the number of iterations seems polynomial, and sometimes linear in the problem size (Borgwardt, 1987; Dantzig and Thapa, 2003).”
• ON A CONVEX MEASURE OF DRAWDOWN RISK (2014, neutral): “We refer the reader to Dantzig and Thapa (1997, 2003) for a review of linear programming algorithms and their complexity.”
• Linear Programming (2018, neutral): “IJIRT 101718 INTERNATIONAL JOURNAL OF INNOVATIVE RESEARCH IN TECHNOLOGY 428 steps, [9] which is similar to its behavior on practical problems.”
• Routing, flow, and capacity design in communication and computer networks (2004, methodology): “Also, specialized polynomial-time simplex algorithms (mostly primaldual) exist for specific classes of LP problems [DT97]; see [KH80] and [BJS90] for such specialized simplex algorithms for single-commodity network flow problems.”