A new steepest edge approximation for the simplex method for linear programming
type: Item
instance of: scholarly article
title: A new steepest edge approximation for the simplex method for linear programming
zbMATH Open document ID: 0912.90220
DOI: 10.1023/A:1018317206484
author: Artur Świȩtanowski
published in: Computational Optimization and Applications
publication date: 1998-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 1230447
zbMATH Keywords: steepest edge approximation
zbMATH Keywords: simplex method
zbMATH Keywords: steepest edge pricing
describes a project that uses: KORBX
describes a project that uses: DEVEX
MaRDI profile type: Publication
Recommended article: Steepest-edge simplex algorithms for linear programming
Recommended article: A steepest feasible direction extension of the simplex method
Recommended article: Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
Recommended article: A steepest edge active set algorithm for solving sparse linear programming problems
Recommended article: A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP
Recommended article: Q4703791
Recommended article: Q4356171
Recommended article: Q4719189
Recommended article: Implementation of a steepest-edge primal-dual simplex method for network linear programs
Recommended article: Q4901344
description: scientific article; zbMATH DE number 1230447