Piecewise linear programming via interior points

DOI10.1016/S0305-0548(99)00075-1zbMATH Open0971.90107OpenAlexW1973135350WikidataQ126989469 ScholiaQ126989469MaRDI QIDQ1582686FDOQ1582686

Authors Mario Conrado Cavichia, Marcos N. Arenales

Publication date 15 October 2000

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0305-0548(99)00075-1

zbMATH Keywords

computational experimentsinterior point algorithmspiecewise linear programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Piecewise-linear programming: The compact (CPLP) algorithm
• A Dual Simplex Algorithm for Piecewise-Linear Programming

Cites work

• scientific article; zbMATH DE number 4064763 (Why is no real title available?)
• scientific article; zbMATH DE number 3523317 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A revised simplex algorithm for the absolute deviation curve fitting problem
• 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
• A survey of search directions in interior point methods for linear programming
• A unified view of interior point methods for linear programming
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation
• An implementation of Karmarkar's algorithm for linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Search directions for interior linear-programming methods

Cited in

(4)

• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• Finding normal solutions in piecewise linear programming
• Some questions of piecewise linear programming
• A parametric simplex algorithm for biobjective piecewise linear programming problems

This page was built for publication: Piecewise linear programming via interior points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582686)