A note on ``An improved initial basis for the simplex algorithm''
type: Item
instance of: scholarly article
title: A note on ``An improved initial basis for the simplex algorithm''
zbMATH Open document ID: 1165.90566
author: Jian-Feng Hu
published in: Computers \& Operations Research
publication date: 2007-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C49
zbMATH DE Number: 5161114
zbMATH Keywords: linear programming
zbMATH Keywords: simplex algorithm
zbMATH Keywords: basis
zbMATH Keywords: lu decomposition
describes a project that uses: MarPlex
MaRDI profile type: Publication
full work available at URL: j.cor.2006.02.004
OpenAlex ID: W2081083555
cites work: Two direct methods in linear programming
cites work: An improved initial basis for the simplex algorithm
cites work: Practical finite pivoting rules for the simplex method
cites work: Q4522255
DOI: 10.1016/J.COR.2006.02.004
Recommended article: An improved initial basis for the simplex algorithm
Recommended article: A basis-defiency-allowing variation of the simplex method for linear programming
Recommended article: Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
Recommended article: Algebraic simplex initialization combined with the nonfeasible basis method
Recommended article: A note on the simplex-cosimplex problem
Recommended article: Implementing the Simplex Method: The Initial Basis
Recommended article: On the simplex algorithm initializing
Recommended article: A note on the distribution of the number of simplex iterations to optimality
Recommended article: Some notes on the nonlinear simplex method
Recommended article: Q4502371
description: scientific article; zbMATH DE number 5161114