Journal of the Operations Research Society of China ›› 2025, Vol. 13 ›› Issue (2): 616-629.doi: 10.1007/s40305-023-00464-6

Previous Articles     Next Articles

A Penalty Function Approach for Solving the Linear Trilevel Programming Problem

Yan Peng, Yi-Bing Lv   

  1. School of Information and Mathematics, Yangtze University, Jingzhou 434023, Hubei, China
  • Received:2021-12-15 Revised:2022-09-19 Online:2025-06-30 Published:2025-07-07
  • Contact: Yi-Bing Lv E-mail:yibinglv@yangtzeu.edu.cn
  • Supported by:
    This work is supported by the National Natural Science Foundation of China (Nos. 12271061,11771058) and the Outstanding Youth Foundation of Hubei Province of China (No. 2019CFA088).

Abstract: In this paper, we mainly focus on the solving approach for the linear trilevel programming (LTP) problem. Firstly, based on the lower-level problem’s Karush-Kuhn-Tucker (K-K-T) optimality conditions, we transform the LTP problem into a bilevel programming (BP) problem with complementary constraints. Secondly, taking the complementary constraints as penalties and appending them to the upper-level objective, a penalized BP problem is obtained. Thirdly, for the penalized BP problem, we use K-K-T optimality conditions again and append the corresponding complementary conditions to the upper level as penalties. Then, an overall penalized problem for the LTP problem is formed; we analyze the characteristics of the optimal solutions of the overall penalized problem and propose a penalty function algorithm. The numerical results show that the penalty function approach is feasible and effective.

Key words: Linear trilevel programming, Karush–Kuhn–Tucker optimality conditions, Penalty function, Optimal solution

CLC Number: