Operations Research Asked on January 1, 2022

For a discrete set of scenarios, minimising value at risk can be formulated as a mixed integer linear programming problem. If each scenario has equal probability then this can be written as

begin{align}

&text{minimize} &gamma\

&text{subject to} &(-r^{s}){‘}X &leq gamma + Mcdot Y_{s} &&text{$s = 1,dots,S$} tag1\

&&frac{1}{S}sum_{s=1}^{S} Y_{s} &leq alpha tag2\

&&Y_{s} &in {0,1} &&text{$s = 1,dots,S$} \

&&sum_{i=1}^{n}x_{i} &= 1

end{align}

where $alpha$ is the confidence level say $0.05$,

$M$ is a big constant,

$r$ is the return on assets,

$x_{i}$ is the percentage in asset $i$, and

$S$ is the number of scenarios.

If we assume that scenarios do not have same probabilities then constraint $(1)$ can be formulated as:

$(-r^{s}cdot P_{s}){‘}X leq gamma + Mcdot Y_{s}$ where $P_{s}$ is the probability of scenario $s$. But I am struggling with redefining constraint $(2)$.

How can this constraint/problem be formulated if scenarios have different probabilities?

How about begin{align}min&quadgamma\text{s.t.}&quad(-r^s)^top Xleq gamma + M Y_s qquad s=1,ldots,S\&quadsum_{s=1}^SP_sY_s leq alpha\&quad sum_{i=1}^nx_i=1\&quad Y_sin{0,1}end{align}

Answered by k88074 on January 1, 2022

1 Asked on August 19, 2021

1 Asked on August 19, 2021

1 Asked on August 19, 2021 by antarctica

2 Asked on August 19, 2021 by qinqinxiaoguai

6 Asked on March 1, 2021 by rajya

integer programming linearization nonlinear programming quadratic programming

1 Asked on March 1, 2021 by windbreeze

1 Asked on February 18, 2021 by dspinfinity

0 Asked on February 18, 2021 by yue-chao

1 Asked on February 15, 2021 by user152503

1 Asked on January 18, 2021

linear programming linearization logical constraints mixed integer programming

0 Asked on January 18, 2021 by amedeo

0 Asked on January 15, 2021 by robert-hildebrand

integer programming optimization scheduling simulated annealing solver

3 Asked on January 11, 2021 by stevgates

1 Asked on January 8, 2021 by fathese

1 Asked on December 22, 2020 by che

binary variable linear programming linearization logical constraints mixed integer programming

1 Asked on December 13, 2020 by high-gpa

3 Asked on November 28, 2020 by joffrey-l

1 Asked on September 25, 2020 by independentvariable

convex optimization convexity nonconvex programming probability distributions

Get help from others!

Recent Answers

- Jon Church on Why fry rice before boiling?
- haakon.io on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?
- Peter Machado on Why fry rice before boiling?

Recent Questions

- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?
- Does Google Analytics track 404 page responses as valid page views?

© 2023 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP