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

Algorithm for maximizing a linear function on the set of integral points of a convex polyhedron

โœ Scribed by Nguen Ngok Tyu

Publisher
Springer US
Year
1987
Tongue
English
Weight
491 KB
Volume
22
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximizing the ratio of two convex funct
Maximizing the ratio of two convex functions over a convex set
โœ 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

An optimal real time algorithm for deter
An optimal real time algorithm for determine the convex hull of a set of points in a plane
โœ Z.Q. Wang; L.J. Xiao ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four