arXiv Analytics

Sign in

arXiv:1905.09636 [math.OC]AbstractReferencesReviewsResources

A Simple Rule to find a Basic Feasible Solution

Rene Grothmann

Published 2019-05-23Version 1

This short note provides and proves an easy algorithm to find a basic feasible solution for the Simplex Algorithm. The method uses a rule similar to Bland's rule for the initial phase of the algorithm.

Comments: 4 Pages
Categories: math.OC
Related articles: Most relevant | Search more
arXiv:2106.09663 [math.OC] (Published 2021-06-17)
A Short Note of PAGE: Optimal Convergence Rates for Nonconvex Optimization
arXiv:1008.4329 [math.OC] (Published 2010-08-25)
On three duality results
arXiv:1807.01382 [math.OC] (Published 2018-07-03)
A simplex algorithm for rational CP-factorization

Links

Toolbox