Centres Of Excellence

To focus on new and emerging areas of research and education, Centres of Excellence have been established within the Institute. These ‘virtual' centres draw on resources from its stakeholders, and interact with them to enhance core competencies

Read More >>

Faculty

Faculty members at IIMB generate knowledge through cutting-edge research in all functional areas of management that would benefit public and private sector companies, and government and society in general.

Read More >>

IIMB Management Review

Journal of Indian Institute of Management Bangalore

IIM Bangalore offers Degree-Granting Programmes, a Diploma Programme, Certificate Programmes and Executive Education Programmes and specialised courses in areas such as entrepreneurship and public policy.

Read More >>

About IIMB

The Indian Institute of Management Bangalore (IIMB) believes in building leaders through holistic, transformative and innovative education

Read More >>

Robust Conic Satisficing

Arjun Ramachandra, Napat Rujeerapaiboon and Melvyn Sim
2025
Working Paper No
708
Body

In practical optimization problems, we typically model uncertainty as a random variable though its true probability distribution is unobservable to the decision maker. Historical data provides some information of this distribution that we can use to approximately quantify the risk of an evaluation function that depends on both our decision and the uncertainty. This empirical optimization approach is vulnerable to the issues of overfitting, which could be overcome by several data-driven robust optimization techniques. To tackle overfitting, Long et.al (2022)  propose a robust satisficing model, which is specified by a performance target and a penalty function that measures the deviation of the uncertainty from its nominal value, and it yields solutions with superior out-of-sample performance. We generalize the robust satisficing framework to conic optimization problems with recourse, which has broader applications in predictive and prescriptive analytics including risk management, statistical supervised learning, among others. We derive an exact semidefinite optimization formulation for biconvex quadratic evaluation function, with quadratic penalty and ellipsoidal support set. More importantly, under complete and bounded recourse, and reasonably chosen polyhedral support set and penalty function, we propose safe approximations that do not lead to infeasible problems for any reasonably chosen target. We demonstrate that the assumption of complete and bounded recourse is however not unimpeachable, and then introduce a novel  perspective casting technique to derive an equivalent conic optimization problem that satisfies the stated assumptions. Finally, we showcase a computational study on data-driven portfolio optimization that maximizes the expected exponential utility of the portfolio returns. We demonstrate that the solutions obtained via robust satisficing can significantly improve over the solutions obtained by stochastic optimization models, including the celebrated Markowitz model, which is prone to overfitting.

Key words
robust optimization, robust satisficing, conic optimization, affine recourse adaptation
WP No. 708.pdf (1.51 MB)

Robust Conic Satisficing

Author(s) Name: Arjun Ramachandra, Napat Rujeerapaiboon and Melvyn Sim, 2025
Working Paper No : 708
Abstract:

In practical optimization problems, we typically model uncertainty as a random variable though its true probability distribution is unobservable to the decision maker. Historical data provides some information of this distribution that we can use to approximately quantify the risk of an evaluation function that depends on both our decision and the uncertainty. This empirical optimization approach is vulnerable to the issues of overfitting, which could be overcome by several data-driven robust optimization techniques. To tackle overfitting, Long et.al (2022)  propose a robust satisficing model, which is specified by a performance target and a penalty function that measures the deviation of the uncertainty from its nominal value, and it yields solutions with superior out-of-sample performance. We generalize the robust satisficing framework to conic optimization problems with recourse, which has broader applications in predictive and prescriptive analytics including risk management, statistical supervised learning, among others. We derive an exact semidefinite optimization formulation for biconvex quadratic evaluation function, with quadratic penalty and ellipsoidal support set. More importantly, under complete and bounded recourse, and reasonably chosen polyhedral support set and penalty function, we propose safe approximations that do not lead to infeasible problems for any reasonably chosen target. We demonstrate that the assumption of complete and bounded recourse is however not unimpeachable, and then introduce a novel  perspective casting technique to derive an equivalent conic optimization problem that satisfies the stated assumptions. Finally, we showcase a computational study on data-driven portfolio optimization that maximizes the expected exponential utility of the portfolio returns. We demonstrate that the solutions obtained via robust satisficing can significantly improve over the solutions obtained by stochastic optimization models, including the celebrated Markowitz model, which is prone to overfitting.

Keywords: robust optimization, robust satisficing, conic optimization, affine recourse adaptation
WP No. 708.pdf (1.51 MB)