✦ LIBER ✦

General Robust-Optimization Formulation for Nonlinear Programming

✍ Scribed by Y. Zhang

Publisher: Springer
Year: 2007
Tongue: English
Weight: 246 KB
Volume: 132
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-006-9082-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Case Studies for a First-Order Robust No

Case Studies for a First-Order Robust Nonlinear Programming Formulation

✍ E. T. Hale; Y. Zhang 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 575 KB

Generalized Nonlinear Lagrangian Formula

Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming

✍ Yifan Xu; Chunli Liu; Duan Li 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 338 KB

Penalty formulation for zero-one nonline

Penalty formulation for zero-one nonlinear programming

✍ B Kalantari; J.B Rosen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Confidence structural robust optimizatio

Confidence structural robust optimization by non-linear semidefinite programming-based single-level formulation

✍ Xu Guo; Jianming Du; Xixin Gao 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

## Abstract Structural robust optimization problems are often solved via the so‐called Bi‐level approach. This solution procedure often involves large computational efforts and sometimes its convergence properties are not so good because of the non‐smooth nature of the Bi‐level formulation. Another

An approximation technique for robust no

An approximation technique for robust nonlinear optimization

✍ Moritz Diehl; Hans Georg Bock; Ekaterina Kostina 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 296 KB

Sufficient optimality criteria in nonlin

Sufficient optimality criteria in nonlinear programming for generalized equality-inequality constraints

✍ C. Singh 📂 Article 📅 1977 🏛 Springer 🌐 English ⚖ 177 KB