Piecewise linear programming via interior points

DOI10.1016/S0305-0548(99)00075-1zbMath0971.90107OpenAlexW1973135350WikidataQ126989469 ScholiaQ126989469MaRDI QIDQ1582686

Marcos Nereu Arenales, Mario Conrado Cavichia

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)

Related Items

A parametric simplex algorithm for biobjective piecewise linear programming problems, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A unified view of interior point methods for linear programming
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• A survey of search directions in interior point methods for linear programming
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• An implementation of Karmarkar's algorithm for linear programming
• On the formulation and theory of the Newton interior-point method for nonlinear programming
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Search directions for interior linear-programming methods
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A revised simplex algorithm for the absolute deviation curve fitting problem
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation