Ein beliebig startender Simplex-Algorithmus

DOI10.1007/BF00947938MaRDI QIDQ794559zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 1984

Published in ZAMP. Zeitschrift für angewandte Mathematik und Physik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00947938

zbMATH Keywords

arbitrary start solutionsimplex-algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
• A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps
• An artificial-free simplex-type algorithm for general LP models
• A new method of avoiding artificial variables for achieving an initial feasible basis of a linear programming
• Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach

Cited in

(5)

• Ein effektives simplexverfahren mit teiltableauwahl
• scientific article; zbMATH DE number 3926626 (Why is no real title available?)
• scientific article; zbMATH DE number 3894829 (Why is no real title available?)
• scientific article; zbMATH DE number 3894831 (Why is no real title available?)
• Ein Algorithmus zur Berechnung der größten Ganzen aus Wurzel d

This page was built for publication: Ein beliebig startender Simplex-Algorithmus

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