𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A relaxation method for solving systems with infinitely many linear inequalities

✍ Scribed by E. González-Gutiérrez; M. I. Todorov

Book ID
107403332
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
208 KB
Volume
6
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving a system of infinitely many fuzz
Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions
✍ Cheng-Feng Hu; Shu-Cherng Fang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 717 KB

A cutting plane type algorithm for solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions is proposed. In each iteration, we solve a finite nonlinear optimization problem and add one or two more constraints. The iterative process ends when an optimal soluti

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