๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Maximal Inradius of the Convex Cover of a Plane Connected set of Given Length

โœ Scribed by Eggleston, H. G.


Book ID
120101444
Publisher
Oxford University Press
Year
1982
Tongue
English
Weight
453 KB
Volume
s3-45
Category
Article
ISSN
0024-6115

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Maximizing the ratio of two convex funct
โœ Harold P. Benson ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 126 KB

## Abstract The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions __f__ and __g__ over a convex set __X__. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound