A General Robust-Optimization Formulation for Nonlinear Programming
DateJuly 2004 (Revised June 2005)
Most research in robust optimization has so far been focused on inequality-only, convex conic programming with simple linear models for uncertain parameters. Many practical optimization problems, however, are nonlinear and non-convex. Even in linear programming, coefficients may still be nonlinear functions of uncertain parameters. In this paper, we propose robust formulations that extend the robust-optimization approach to a general nonlinear programming setting with parameter uncertainty involving both equality and inequality constr aints. The proposed robust formulations are valid in a neighborhood of a given nominal parameter value and are robust to the first-order, thus suitable for app lications where reasonable parameter estimations are available and uncertain var iations are moderate.
Citable link to this pagehttps://hdl.handle.net/1911/102025
MetadataShow full item record
- CAAM Technical Reports