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

New purification algorithms for linear programming

โœ Scribed by K. O. Kortanek; Zhu Jishan


Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
675 KB
Volume
35
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Deterministic Algorithms for 2-d Convex
โœ Timothy M Chan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 228 KB

We present a deterministic algorithm for solving two-dimensional convex pro-ลฝ . grams with a linear objective function. The algorithm requires O k log k primitive operations for k constraints; if a feasible point is given, the bound reduces to ลฝ . O k log krlog log k . As a consequence, we can decid