<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We consider the problem of the computation of inf<sub>p</sub> θp over the set of exponent pairs P ∋ p under linear constrains for a certain class of objective functions θ. An effective algorithm is presented. The output of the algorithm leads to the improvement and establishing new estimates in the various divisor problems in the analytical number theory.</p></abstract>

We consider the problem of the computation of infp θp over the set of exponent pairs P ∋ p under linear constrains for a certain class of objective functions θ. An effective algorithm is presented. The output of the algorithm leads to the improvement and establishing new estimates in the various divisor problems in the analytical number theory.

Linear programming over exponent pairs

I. I. Mechnikov Odessa National University, Russia

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

{"article-title":"Linear programming over exponent pairs"}

We consider the problem of the computation of infp θp over the set of exponent pairs P ∋ p under linear constrains for a certain class of objective functions...

Linear programming over exponent pairs

Publicado en línea: 30 may 2014

Páginas: 271 - 287

Recibido: 28 ago 2013

DOI: https://doi.org/10.2478/ausi-2014-0014

Palabras clave
linear programming, exponent pairs, divisor problem

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linear programming over exponent pairs

Publicado en línea: 30 may 2014

Páginas: 271 - 287

Recibido: 28 ago 2013

DOI: https://doi.org/10.2478/ausi-2014-0014

Palabras clavelinear programming, exponent pairs, divisor problem

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Palabras clave
linear programming, exponent pairs, divisor problem