Integer minimization of fractional-separable functions
โ Scribed by G.B. Rubal'skii
- Publisher
- Elsevier Science
- Year
- 1990
- Weight
- 899 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0041-5553
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
VfE[!. kj. 1 Ji+, Si#S)l have been studied Dreviously by Hcarnz and Wagner. The prrsent paper \*-eats three arrays. rG(n. k). 61(n. k). and k(n. k). which extend min. k i in the sense .:hat I ., PI --l R\*k)=~(p,...p,.k)=ri(p,.. -p,. k)= ni(s.k) for all sequences (r,. . . . \_p,l of distinct primes.
In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametr