Bisection based algorithm for linear program.
Abstract
Thank to Chubanov algorithm, there is today a strongly polynomial time algorithm to solve linear feasibility problem.
In this paper, we offer an algorithm for generic linear program based on bisection space using Chubanov algorithm as routine.
The complexity of the algorithm is not established but is linked to geometric statements.
Domains
Operations Research [math.OC]
Fichier principal
Bisection_based_algorithm_for_linear_program.pdf (282.49 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Loading...