Pages that link to "Item:Q3703668"
From MaRDI portal
The following pages link to A simplex algorithm for piecewise-linear programming I: Derivation and proof (Q3703668):
Displaying 39 items.
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks (Q438224) (← links)
- A simplex algorithm for piecewise-linear fractional programming problems (Q859908) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Degeneracy in the presence of roundoff errors (Q1105984) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications (Q1184346) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- Optimal expansion of capacitated transshipment networks (Q1266668) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- The empirical performance of a polynomial algorithm for constrained nonlinear optimization (Q1309871) (← links)
- Vendor selection with price breaks (Q1309983) (← links)
- On degeneracy in linear programming and related problems (Q1312772) (← links)
- Piecewise lexicographic programming: A new model for practical decision problems (Q1321139) (← links)
- A restricted-entry method for a transportation problem with piecewise- linear concave costs (Q1332825) (← links)
- Optimal objective function approximation for separable convex quadratic programming (Q1340073) (← links)
- Discontinuous piecewise linear optimization (Q1380942) (← links)
- Piecewise linear programming via interior points (Q1582686) (← links)
- The hill detouring method for minimizing hinging hyperplanes functions (Q1762167) (← links)
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming (Q1934641) (← links)
- A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
- On location-allocation problems for dimensional facilities (Q2317850) (← links)
- Vector and matrix apportionment problems and separable convex integer optimization (Q2482690) (← links)
- A parametric simplex algorithm for biobjective piecewise linear programming problems (Q2628166) (← links)
- Mixed integer linear programming formulation techniques (Q2808240) (← links)
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach (Q3087842) (← links)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof (Q3703668) (← links)
- Piecewise-linear programming: The compact (CPLP) algorithm (Q3754440) (← links)
- Designing satellite communication networks by zero—one quadratic programming (Q3823407) (← links)
- Transporting and Mixing Gasses with Different Qualities (Q4350498) (← links)
- Transporting and Mixing Gasses with Different Qualities (Q4352656) (← links)
- (Q4382755) (← links)
- Multiple objective programming with piecewise linear functions (Q4516915) (← links)
- Formalization of Incremental Simplex Algorithm by Stepwise Refinement (Q4647860) (← links)
- On a dual method for a specially structured linear programming problem with application to stochastic programming (Q4709734) (← links)
- A Dual Simplex Algorithm for Piecewise-Linear Programming (Q4717146) (← links)
- An algorithm for piece-wise indefinite quadratic programming problem (Q5147642) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- An algorithm for linearly-constrained piecewise lexicographic programming problems. (Q5958084) (← links)