A phase-1 approach for the generalized simplex algorithm
type: Item
instance of: scholarly article
title: A phase-1 approach for the generalized simplex algorithm
zbMATH Open document ID: 1002.90036
DOI: 10.1016/S0898-1221(01)00254-1
author: Ping-Qi Pan
author: Yunpeng Pan
publication date: 2002-08-25T00:00:00Z
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1787777
zbMATH Keywords: degeneracy
zbMATH Keywords: deficient basis
zbMATH Keywords: LU-decomposition
zbMATH Keywords: phase-1
zbMATH Keywords: single artificial variable
zbMATH Keywords: simplex algorithm
zbMATH Keywords: linear programming
describes a project that uses: DEVEX
describes a project that uses: SCICONIC
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
cites work: Programming of Interdependent Activities: II Mathematical Model
cites work: A basis-defiency-allowing variation of the simplex method for linear programming
cites work: Q4178772
cites work: A stabilization of the simplex method
cites work: The simplex method of linear programming using LU decomposition
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: New Finite Pivoting Rules for the Simplex Method
cites work: Q3229788
cites work: Optimality and Degeneracy in Linear Programming
cites work: Q4079613
cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints
cites work: Q3844775
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: Q4040780
cites work: Q5185900
cites work: Practical finite pivoting rules for the simplex method
cites work: A simplex-like method with bisection for linear programming1
cites work: Q4888222
cites work: The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
cites work: A dual projective simplex method for linear programming
cites work: A projective simplex method for linear programming
cites work: A projective simplex algorithm using LU decomposition
cites work: Q3818127
cites work: A convergent criss-cross method
cites work: The Criss-Cross Method for Solving Linear Programming Problems
Wikidata QID: Q127946022
published in: Computers & Mathematics with Applications
Recommended article: A general phase-I method in linear programming
Recommended article: The generalized simplex method
Recommended article: A piecewise linear dual phase-1 algorithm for the simplex method
Recommended article: An improved general Phase-I method in linear programming
Recommended article: A generalized dual phase-2 simplex algorithm.
Recommended article: Improving the efficiency of the simplex algorithm based on a geometric explanation of phase 1
Recommended article: Q3318545
Recommended article: Q5329507
Recommended article: Q5165812
Recommended article: Q3501224
description: scientific article; zbMATH DE number 1787777