A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
[For part II see the author, ibid. 41, No. 3, 281-315 (1988; Zbl 0656.90062).] This is the last part of a paper devoted to a simplex algorithm for minimizing convex separable piecewise-linear functions subject to linear constraints. The author demonstrates the inherent advantages of the direct piecewise-linear simplex implementation over an indirect approach that relies on transformation to a linear program. These advantages are shown to be implicit in relationships between the linear and piecewise- linear algorithms and largely independent of the details of implementation (in two sets of computational results, the piecewise- linear simplex is observed to run 2-6 times faster than a comparable linear algorithm). A survey of many varied applications of piecewise linear programming is also given.
- A Dual Simplex Algorithm for Piecewise-Linear Programming
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear fractional programming problems
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- A linear programming approach to the chemical equilibrium problem
- A practicable steepest-edge simplex algorithm
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- scientific article; zbMATH DE number 3856812 (Why is no real title available?)
- Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
- Optimal estimation of executive compensation by linear programming
- Recent advances in linear programming
- Relationships among linear formulations of separable convex piecewise linear programs
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- Algorithms for network piecewise-linear programs: A comparative study
- Vendor selection with price breaks
- A restricted-entry method for a transportation problem with piecewise- linear concave costs
- Optimal objective function approximation for separable convex quadratic programming
- Discontinuous piecewise linear optimization
- Piecewise linear programming via interior points
- The hill detouring method for minimizing hinging hyperplanes functions
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- A simplex algorithm for network flow problems with piecewise linear fractional objective function
- A parametric simplex algorithm for biobjective piecewise linear programming problems
- Mixed integer linear programming formulation techniques
- Objective variation simplex algorithm for continuous piecewise linear programming
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- An efficient algorithm for minimizing a multivariate polyhedral function along a line
- Piecewise-linear programming: The compact (CPLP) algorithm
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- scientific article; zbMATH DE number 176425 (Why is no real title available?)
- scientific article; zbMATH DE number 1195629 (Why is no real title available?)
- Multiple objective programming with piecewise linear functions
- A Dual Simplex Algorithm for Piecewise-Linear Programming
- scientific article; zbMATH DE number 776091 (Why is no real title available?)
- An algorithm for piece-wise indefinite quadratic programming problem
- A generalized linear and piecewise-linear program
- scientific article; zbMATH DE number 2246654 (Why is no real title available?)
- An algorithm for linearly-constrained piecewise lexicographic programming problems.
- A simplex algorithm for piecewise-linear fractional programming problems
- A survey of dynamic network flows
This page was built for publication: A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184346)
