✦ LIBER ✦

Random linear programs with many variables and few constraints

✍ Scribed by Charles Blair

Publisher: Springer-Verlag
Year: 1986
Tongue: English
Weight: 437 KB
Volume: 34
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01582163

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Zero-one programming with many variables

Zero-one programming with many variables and few constraints

✍ A.L. Soyster; B. Lev; W. Slivka 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 940 KB

Random inequality constraint systems wit

Random inequality constraint systems with few variables

✍ Charles Blair 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 186 KB

Solving convex programs with infinitely

Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

✍ Soon-Yi Wu; S.-C. Fang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut

Zero-one integer programs with few const

Zero-one integer programs with few constraints —Efficient branch and bound algorithms

✍ Bezalel Gavish; Hasan Pirkul 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 723 KB

A randomized scheme for speeding up algo

A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio

✍ Ilan Adler; Ron Shamir 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 908 KB

Solving linear programs with finite prec

Solving linear programs with finite precision: I. Condition numbers and random programs

✍ Dennis Cheung; Felipe Cucker 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 211 KB