✦ LIBER ✦

An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints

✍ Scribed by Shu-Cherng Fang; H.-S. Jacob Tsao

Book ID: 107989168
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 1011 KB
Volume: 72
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(95)00266-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for solving semi-

An efficient algorithm for solving semi-infinite inequality problems with box constraints

✍ D. Q. Mayne; H. Michalska; E. Polak 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 1014 KB

Two new algorithms for solving optimizat

Two new algorithms for solving optimization problems with one linear objective function and finitely many constraints of fuzzy relation inequalities

✍ Ali Abbasi Molai 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 877 KB

This paper studies the optimization model of a linear objective function subject to a system of fuzzy relation inequalities (FRI) with the max-Einstein composition operator. If its feasible domain is non-empty, then we show that its feasible solution set is completely determined by a maximum solutio

An affine scaling interior trust region

An affine scaling interior trust region method via optimal path for solving monotone variational inequality problem with linear constraints

✍ Yunjuan Wang; Detong Zhu 📂 Article 📅 2008 🏛 Coastal and Estuarine Research Federation 🌐 English ⚖ 261 KB