Ein beliebig startender Simplex-Algorithmus

DOI10.1007/BF00947938zbMATH Open0539.90060OpenAlexW2020658232MaRDI QIDQ794559FDOQ794559

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

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

zbMATH Keywords

arbitrary start solutionsimplex-algorithm

Mathematics Subject Classification ID

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

Cited In (5)

• Ein effektives simplexverfahren mit teiltableauwahl
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)