An active-set with barrier method and trust-region mechanism to solve a nonlinear Bilevel programming problem-Reference-Cited by-同舟云学术

An active-set with barrier method and trust-region mechanism to solve a nonlinear Bilevel programming problem

Published:2022 Issue:9 Volume:7 Page:16112-16146
ISSN:2473-6988
Container-title:AIMS Mathematics
language:
Short-container-title:MATH

Author:

El-Sobky B.¹,Ashry G.¹,Abo-Elnaga Y.²

Affiliation:

1. Department of Mathematics and Computer Science, Alexandria University, Faculty of Science, Egypt

2. Department of basic science, Tenth of Ramadan City, Higher Technological Institute, Egypt

Abstract

<abstract><p>Nonlinear Bilevel programming (NBLP) problem is a hard problem and very difficult to be resolved by using the classical method. In this paper, Karush-Kuhn-Tucker (KKT) condition is used with Fischer-Burmeister function to convert NBLP problem to an equivalent smooth single objective nonlinear programming (SONP) problem. An active-set strategy is used with Barrier method and trust-region technique to solve the smooth SONP problem effectively and guarantee a convergence to optimal solution from any starting point. A global convergence theory for the active-set barrier trust-region (ACBTR) algorithm is studied under five standard assumptions. An applications to mathematical programs are introduced to clarify the effectiveness of ACBTR algorithm. The results show that ACBTR algorithm is stable and capable of generating approximal optimal solution to the NBLP problem.</p></abstract>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Reference48 articles.

1. D. Aksen, S. Akca, N. Aras, A bilevel partial interdiction problem with capacitated facilities and demand outsourcing, Comput. Oper. Res., 41 (2014), 346–358. https://doi.org/10.1016/j.cor.2012.08.013

2. Y. Abo-Elnaga, M. El-Shorbagy, Multi-sine cosine algorithm for solving nonlinear bilevel programming problems, Int. J. Comput. Int. Sys., 13 (2020), 421–432. https://doi.org/10.2991/ijcis.d.200411.001

3. A. Burgard, P. Pharkya, C. Maranas, Optknock: A bilevel programming framework for identifying gene knockout strategies formicrobial strain optimization, Biotechnol. Bioeng., 84 (2003), 647–657. https://doi.org/10.1002/bit.10803

4. M. Bazaraa, H. Sherali, C. Shetty, Nonlinear programming theory and algorithms, Hoboken: John Wiley and Sons, 2006.

5. O. Ben-Ayed, O. Blair, Computational difficulty of bilevel linear programming, Oper. Res., 38 (1990), 556–560. https://doi.org/10.1287/opre.38.3.556

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A nonmonton active interior point trust region algorithm based on CHKS smoothing function for solving nonlinear bilevel programming problems;AIMS Mathematics;2024

2. A trust-region based an active-set interior-point algorithm for fuzzy continuous Static Games;AIMS Mathematics;2023