Optimization Online


On the Global Minimization of the Value-at-Risk

Jong-Shi Pang (pangj***at***rpi.edu)
Sven Leyffer (leyffer***at***mcs.anl.gov)

Abstract: In this paper, we consider the nonconvex minimization problem of the value-at-risk (VaR) that arises from financial risk analysis. By considering this problem as a special linear program with linear complementarity constraints (a bilevel linear program to be more precise), we develop upper and lower bounds for the minimum VaR and show how the combined bounding procedures can be used to compute the latter value to global optimality. A numerical example is provided to illustrate the methodology.


Category 1: Complementarity and Variational Inequalities

Category 2: Global Optimization

Category 3: Nonlinear Optimization

Citation: Preprint ANL/MCS-P1112-1203, Argonne National Laboratory, Argonne, IL 60439, December 2003

Download: [Postscript][Compressed Postscript][PDF]

Entry Submitted: 12/22/2003
Entry Accepted: 12/23/2003
Entry Last Modified: 12/22/2003

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society