Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
type: Item
instance of: scholarly article
title: Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
zbMATH Open document ID: 1231.90287
author: Camelia Al-Najjar
author: Behnam B. Malakooti
published in: Computers \& Operations Research
publication date: 2010-10-15T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 5800830
zbMATH Keywords: linear programming
zbMATH Keywords: gradient method
zbMATH Keywords: simplex
zbMATH Keywords: pivoting
zbMATH Keywords: interior direction
zbMATH Keywords: extreme point
zbMATH Keywords: initialization
zbMATH Keywords: computational efficiency
zbMATH Keywords: adaptive
zbMATH Keywords: hybrid LP
describes a project that uses: CONOPT
describes a project that uses: MarPlex
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
full work available at URL: j.cor.2010.07.001
OpenAlex ID: W2071119412
cites work: A lower bound on the average number of pivot-steps for solving linear programs. Valid for all variants of the simplex-algorithm
cites work: Comments on ''An efficient search direction for linear programming problems'' by H. Luh and R. Tsaih.
cites work: The simplex algorithm with a new primal and dual pivot rule
cites work: Dealing with degeneracy in reduced gradient algorithms
cites work: CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
cites work: Q3730340
cites work: Experiments with external pivoting
cites work: Computational behavior of a feasible direction method for linear programming
cites work: A note on ``An improved initial basis for the simplex algorithm''
cites work: An improved initial basis for the simplex algorithm
cites work: Q4051879
cites work: An efficient search direction for linear programming problems
cites work: Q3976517
cites work: An infeasible (exterior point) simplex algorithm for assignment problems
cites work: A new efficient primal dual simplex algorithm
cites work: Two direct methods in linear programming
cites work: Pivot versus interior point methods: Pros and cons
DOI: 10.1016/J.COR.2010.07.001
description: scientific article; zbMATH DE number 5800830