Linear programming: convergence of the long-pass primal-dual algorithm by the barrier function method
DOI:
https://doi.org/10.15381/pesquimat.v24i1.20558Keywords:
Convex programming, central path, interior point method, primal-dual algorithmAbstract
In this work we will try to develop and describe the primal-dual interior point method to solve the linear programming problem. This method is characterized by using barrier functions, for the primal problem and for the dual and thus deduce the primal-dual nonlinear system, whose solution defines the central path of the interior point method. It is shown that the total number of iterations that it executes is of polynomial order.
Downloads
Published
Issue
Section
License
Copyright (c) 2021 Juan Luna Valdez, Edinson Montoro Alegre
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
THE AUTHORS RETAIN THEIR RIGHTS:
a) The authors retain their trademark and patent rights, and also on any process or procedure described in the article.
b) The authors retain the right to share, copy, distribute, execute and publicly communicate the article published in Pesquimat magazine (for example, place it in an institutional repository or publish it in a book), with recognition of its initial publication in the Pesquimat magazine.
c) The authors retain the right to make a later publication of their work, to use the article or any part of it (for example: a compilation of their works, notes for conferences, thesis, or for a book), provided that they indicate the source of publication (authors of the work, magazine, volume, number and date).
