Ein beliebig startender Simplex-Algorithmus
From MaRDI portal
Publication:794559
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)- scientific article; zbMATH DE number 3894831 (Why is no real title available?)
- scientific article; zbMATH DE number 3926626 (Why is no real title available?)
- scientific article; zbMATH DE number 3894829 (Why is no real title available?)
- Ein effektives simplexverfahren mit teiltableauwahl
- 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)