Pages that link to "Item:Q2778587"

The following pages link to Evolution of Linear Programming Computing Techniques (Q2778587):

Displaying 36 items.

• A regularized simplex method (Q302140) (← links)
• Scaling linear optimization problems prior to application of the simplex method (Q453620) (← links)
• New crash procedures for large systems of linear constraints (Q584077) (← links)
• Vector processing in simplex and interior methods for linear programming (Q751499) (← links)
• On the optimal value function for certain linear programs with unbounded optimal solution sets (Q795745) (← links)
• A note on the continuity of solutions of parametric linear programs (Q917451) (← links)
• Towards a practical parallelisation of the simplex method (Q970132) (← links)
• A relaxed version of Karmarkar's method (Q1108926) (← links)
• The free parametrization for linear programming with bounded variables (Q1242105) (← links)
• A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
• Parallelizing the dual revised simplex method (Q1646685) (← links)
• A two-phase support method for solving linear programs: numerical experiments (Q1954826) (← links)
• An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
• Formal optimization of some reduced linear programming problems (Q3320119) (← links)
• A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
• Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
• Solving systems of equations with multi-stage Monte Carlo optimization (Q3702412) (← links)
• On scaling linear programs—some experimental results (Q3835674) (← links)
• Characterizations of optimal scalings of matrices (Q3878655) (← links)
• A degeneracy exploiting LU factorization for the simplex method (Q3885512) (← links)
• Methods of parametric non-linear programming (Q3895240) (← links)
• Solving staircase linear programs by the simplex method, 1: Inversion (Q3948887) (← links)
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases (Q3955153) (← links)
• Determining GUB sets via an invert agenda algorithm (Q4048848) (← links)
• Heuristische Lösungsverfahren Versuch einer Begriffsklärung (Q4070995) (← links)
• A dual decomposition algorithm (Q4120282) (← links)
• A model to support decision making for the energy supply-system of a metropolitan area† (Q4174498) (← links)
• The BPMPD interior point solver for convex quadratic problems (Q4504788) (← links)
• Solving staircase linear programs by the simplex method, 2: Pricing (Q4744058) (← links)
• A procedure for the one-parametric linear complementarity problem (Q4764898) (← links)
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method (Q4777052) (← links)
• Some Results on Sparse Matrices (Q5641963) (← links)
• A chance-constrained programming algorithm (Q5661712) (← links)
• A heuristic to reduce the wrapping effect in the numerical solution ofx′=f(t,x) (Q5666093) (← links)
• Proximate linear programming: A variable extreme point method (Q5666391) (← links)
• A procedure for parameterizing a constraint in linear programming (Q5685854) (← links)