Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods

DOI10.1016/J.COR.2010.07.001MaRDI QIDQ709179zbMATH OpenOpenAlexFDO

Authors Camelia Al-Najjar, Behnam B. Malakooti

Publication date 15 October 2010

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

Full work available at URL https://doi.org/10.1016/j.cor.2010.07.001

zbMATH Keywords

adaptivecomputational efficiencyextreme pointgradient methodhybrid LPinitializationinterior directionlinear programmingpivotingsimplex

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49) Interior-point methods (90C51)

Recommendations

• An improved initial basis for the simplex algorithm
• Experimental investigations in combining primal dual interior point method and simplex based LP solvers
• The complex interior-boundary method for linear and nonlinear programming with linear constraints
• Improving a primal–dual simplex-type algorithm using interior point methods
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms

Cites work

• A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
• A new efficient primal dual simplex algorithm
• A note on ``An improved initial basis for the simplex algorithm
• An efficient search direction for linear programming problems
• An improved initial basis for the simplex algorithm
• An infeasible (exterior point) simplex algorithm for assignment problems
• Comments on An efficient search direction for linear programming problems by H. Luh and R. Tsaih.
• Computational behavior of a feasible direction method for linear programming
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Dealing with degeneracy in reduced gradient algorithms
• Experiments with external pivoting
• scientific article; zbMATH DE number 3961338 (Why is no real title available?)
• scientific article; zbMATH DE number 19091 (Why is no real title available?)
• scientific article; zbMATH DE number 3466805 (Why is no real title available?)
• Pivot versus interior point methods: Pros and cons
• The simplex algorithm with a new primal and dual pivot rule
• Two direct methods in linear programming

Cited in

(6)

• Experimental investigations in combining primal dual interior point method and simplex based LP solvers
• A triangulation and fill-reducing initialization procedure for the simplex algorithm
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Improving a primal–dual simplex-type algorithm using interior point methods
• Hybrid method for linear programming
• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound

Describes a project that uses

Uses Software

• CONOPT
• MarPlex
• NETLIB LP Test Set

This page was built for publication: Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods

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