Abstract
Order-value optimization (OVO) is a generalization of the minimax problem motivated by decision-making problems under uncertainty and by robust estimation. New optimality conditions for this nonsmooth optimization problem are derived. An equivalent mathematical programming problem with equilibrium constraints is deduced. The relation between OVO and this nonlinear-programming reformulation is studied. Particular attention is given to the relation between local minimizers and stationary points of both problems.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Manuscript received: April 2004 / Final version received: September 2004
This research was supported by CNPq and FAPESP (PT 2001-04597-4)
This author was supported by FAPESP (Grant 01/05492-1) and CNPq (Grant 301115/96-6).
Rights and permissions
About this article
Cite this article
Andreani, R., Dunder, C. & Martínez, J.M. Nonlinear-programming reformulation of the order-value optimization problem. Math Meth Oper Res 61, 365–384 (2005). https://doi.org/10.1007/s001860400410
Issue Date:
DOI: https://doi.org/10.1007/s001860400410