Operations Research Transactions ›› 2026, Vol. 30 ›› Issue (3): 41-55.doi: 10.15960/j.cnki.issn.1007-6093.2026.03.003

Special Issue: 运筹与管理前沿:模型、算法及其应用专辑

Previous Articles     Next Articles

A bilevel programming model for optimal portfolio liquidation problem

LI Xuepeng1, XU Fengmin2†   

  1. 1. School of Mathematics, Xi'an University of Finance and Economics, Xi'an 710100, Shaanxi, China;
    2. School of Economics and Finance, Xi'an Jiaotong University, Xi'an 710061, Shaanxi, China
  • Received:2026-06-25 Published:2026-09-12

Abstract: To address the limitation of traditional optimal portfolio liquidation models that overlook strategic interactions, this paper develops a bilevel programming model for portfolio liquidation, characterizing the sequential trading game between a leader and a follower. Theoretical analysis explicitly characterizes the follower's optimal strategy, proves that the cash constraint is active at the optimum, and quantifies the leader's additional loss caused by the follower's trading. A hybrid quantum-behaved particle swarm optimization algorithm is designed to solve the nonconvex nested model. Numerical experiments show that a disadvantaged leader tends to preemptively liquidate vulnerable assets to avoid price declines triggered by the follower; ignoring the game mechanism can result in a relative loss of up to 46.6%.

Key words: optimal liquidation, bilevel programming, convex QCQP, financial optimization, portfolio management

CLC Number: