Primal-dual method for a linear program with hybrid direction
by Rima Guerbane; Mohand Ouamer Bibi
International Journal of Mathematics in Operational Research (IJMOR), Vol. 23, No. 3, 2022

Abstract: In linear programming, the combination of primal and dual methods is of great importance in the search of efficient resolution algorithms. In the present paper, we are interested to the adaptive method with hybrid direction for the linear programs with bounded variables. After calculating the increment of the dual function with this hybrid direction, an optimality criterion for the dual problem is proved. Using this criterion and the initial speed of change for the dual function, a primal-dual algorithm with hybrid direction is suggested for solving linear programs with bounded variables. In this algorithm, the suboptimality estimate is used as a stopping criterion. A numerical example is presented and to compare the suggested method with three other methods, we have developed an implementation under the MATLAB programming language on randomly generated problems with precision ε ≥ 0, chosen in advance.

Online publication date: Thu, 01-Dec-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com