Author(s)

Saliha Belahcene¹, Philippe Marthon², Mohamed Aidene³

¹Mouloud Mammeri University of Tizi-Ouzou, Tizi-Ouzou, Algeria.
²Site ENSEEIHT de l’IRIT, Université Fédérale Toulouse Midi-Pyrénées, Toulouse, France.
³L2CSP Laboratory Design and Control Systems Production, Tizi-Ouzou, Algeria.

A new variant of the Adaptive Method (AM) of Gabasov is presented, to minimize the computation time. Unlike the original method and its some variants, we need not to compute the inverse of the basic matrix at each iteration, or to solve the linear systems with the basic matrix. In fact, to compute the new support feasible solution, the simplex pivoting rule is used by introducing a matrix that we will define. This variant is called “the Pivot Adaptive Method” (PAM); it allows presenting the resolution of a given problem under the shape of successive tables as we will see in example. The proofs that are not given by Gabasov will also be presented here, namely the proofs for the theorem of the optimality criterion and for the theorem of existence of an optimal support, and at the end, a brief comparison between our method and the Simplex Method will be given.

Optimization, Linear Programming, Simplex Method, Adaptive Method

Belahcene, S. , Marthon, P. and Aidene, M. (2018) The Pivot Adaptive Method for Solving Linear Programming Problems. American Journal of Operations Research, 8, 92-111. doi: 10.4236/ajor.2018.82008.