Solving linear program with Chubanov queries and bisection moves.

Adrien Chan-Hon-Tong (1)

1 ONERA, Université Paris Saclay (COmUE) [Palaiseau]

This short article focus on the link between linear feasibility and generic linear program. An algorithm is presented to solve generic linear program using linear feasibility queries and working at constraint level instead of raw values level. Even if the number of required linear feasibility queries is not established, this algorithm may be especially interesting, since, thank to Chubanov algorithm, there is a strongly polynomial time algorithm to solve linear feasibility problem.

Mots clés: Strongly polynomial; Linear programming

Domaines: Recherche opérationnelle [math.OC]

Adrien Chan-Hon-Tong. Solving linear program with Chubanov queries and bisection moves.. 2019. ⟨hal-00722920v10⟩