Pages that link to "Item:Q3948887"
From MaRDI portal
The following pages link to Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887):
Displaying 18 items.
- Parallel processors for planning under uncertainty (Q751510) (← links)
- An analysis of an available set of linear programming test problems (Q1113798) (← links)
- Optimization with staircase structure: An application to generation scheduling (Q1263534) (← links)
- A fast LU update for linear programming (Q1309856) (← links)
- MOPS -- Mathematical optimization system (Q1317161) (← links)
- Sensitivity method for basis inverse representation in multistage stochastic linear programming problems (Q1321212) (← links)
- A clustering heuristic to detect staircase structures in large scale linear programming models (Q1331570) (← links)
- Parallel decomposition of multistage stochastic programming problems (Q1803606) (← links)
- Cascading-heuristics for the solution of staircase linear programs (Q1891238) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- On a distributed implementation of a decomposition method for multistage linear stochastic programs (Q2785399) (← links)
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method (Q3026741) (← links)
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems (Q3221769) (← links)
- Revised dantzig-wolfe decomposition for staircase-structured linear programs (Q3779999) (← links)
- On scaling linear programs—some experimental results (Q3835674) (← links)
- Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
- Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
- On the Combinatorial Diameters of Parallel and Series Connections (Q6188515) (← links)
