Deepest point of a polyhedron and linear programming

DOI10.1080/02331934.2012.756877MaRDI QIDQ4981863zbMATH OpenOpenAlexFDO

Authors Ján Plesník

Publication date 20 March 2015

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2012.756877

zbMATH Keywords

bad examplesball centredeepest point of polyhedroninterior point methodlinear inequalitieslinear programming

Mathematics Subject Classification ID

Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Optimality conditions and duality in mathematical programming (90C46) Interior-point methods (90C51)

Recommendations

• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 3972641
• On the finite convergence of interior-point algorithms for linear programming
• scientific article; zbMATH DE number 5585899
• Interior point algorithm for linear programming problem and related inscribed ellipsoids

Cites work

• A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming
• A strongly polynomial algorithm for a new class of linear inequalities¹
• A Strongly Polynomial Algorithm for a Special Class of Linear Programs
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• An efficient simplex type algorithm for sparse and dense linear programs.
• Finding the orthogonal projection of a point onto an affine subspace
• Linear Programming in Linear Time When the Dimension Is Fixed
• Note on implementing the new sphere method for LP using matrix inversions sparingly
• On Mehrotra-Type Predictor-Corrector Algorithms
• On the solution of determinantal systems of linear inequalities
• The sagitta method for solving linear programs
• Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
• Zonotopes and the LP-Newton method

Describes a project that uses

Uses Software

• Optimization Toolbox
• Matlab

This page was built for publication: Deepest point of a polyhedron and linear programming

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