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 θ. An effective algorithm is presented. The output of the algorithm leads to the improvement and establishing new estimates in the various div...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2013-12-01
|
| Series: | Acta Universitatis Sapientiae: Informatica |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/ausi-2014-0014 |