✦ LIBER ✦

A hierarchy of relaxations for nonlinear convex generalized disjunctive programming

✍ Scribed by Juan P. Ruiz; Ignacio E. Grossmann

Book ID: 113583878
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 483 KB
Volume: 218
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hierarchy of relaxations for linear ge

A hierarchy of relaxations for linear generalized disjunctive programming

✍ Nicolas Sawaya; Ignacio Grossmann 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 388 KB

Generalized Convex Disjunctive Programmi

Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation

✍ Ignacio E. Grossmann; Sangbum Lee 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 179 KB

A study on optimality and duality theore

A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming

✍ E.E. Ammar 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 299 KB

This paper is concerned with the study of necessary and sufficient optimality conditions for convex-concave generalized fractional disjunctive programming problems for which the decision set is the union of a family of convex sets. The Lagrangian function for such problems is defined and the Kuhn-Tu

A Hierarchy of Relaxations Leading to th

A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems

✍ Warren P. Adams; Hanif D. Sherali 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 414 KB

A relaxed version of Bregman's method fo

A relaxed version of Bregman's method for convex programming

✍ A. R. Pierro; A. N. Iusem 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 805 KB

A Nonlinear Analytic Center Cutting Plan

A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems

✍ Mokhtarian, F. Sharifi; Goffin, J. L. 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 414 KB