𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Homotopy techniques in linear programming

✍ Scribed by J. L. Nazareth


Publisher
Springer
Year
1986
Tongue
English
Weight
362 KB
Volume
1
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Solving interval linear systems with lin
✍ O. Beaumont πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 919 KB

In this paper, we show how it is possible to use convex polyhedra for solving linear interval systems without using preconditioning. We first show how to derive, from an enclosure of t3Z'([A], [b]), a polyhedron which contains the convex hull of the solution set, Then, a simplex-like method enables