Nonlinear-Programming Reformulation of the Order-Value Optimization problem

Roberto Andreani (andreaniime.unicamp.br)
Cibele Dunder (dunderime.usp.br)
José Mario Martínez (martinezime.unicamp.br)

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.

Keywords: Order-value optimization, optimality conditions, nonlinear-programming, equilibrium constraints, optimization algorithms.

Category 1: Nonlinear Optimization

Citation:

Download: [Postscript][Compressed Postscript]

Entry Submitted: 09/17/2004
Entry Accepted: 09/17/2004
Entry Last Modified: 09/17/2004

Modify/Update this entry