Skip to main content
Log in

Nonlinear-programming reformulation of the order-value optimization problem

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Andreani.

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

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001860400410

Keywords

Navigation