Comparison of the branching and determination algorithm with Taylor's method for solving bi-level nonlinear programming with a practical application.
DOI:
https://doi.org/10.31272/jae.i133.938Keywords:
nonlinear bi-level programming, Taylor method, selection, and branching algorithmAbstract
In this research, two methods of solving non-linear Bi-level Programming are used, they are the Beanch and Bound Algorithm and Taylor method and they are compared in terms of the value of the objective function to reach the optimal solution through the method of Simulation using Monte Carlo method and different sample sizes small and large, and the preference of the selection and branching algorithm was reached in solving the non-linear two-level programming problem because its results were better in terms of cost reduction.
In this research, two methods of solving non-linear Bi-level Programming are used, they are the Beanch and Bound Algorithm and Taylor method and they are compared in terms of the value of the objective function to reach the optimal solution through the method of Simulation using Monte Carlo method and different sample sizes small and large, and the preference of the selection and branching algorithm was reached in solving the non-linear two-level programming problem because its results were better in terms of cost reduction.
References
- Bard, J. F., & Moore, J. T. (1990). “A branch and bound algorithm for the bilevel programming problem”. SIAM Journal on Scientific and Statistical Computing, 11(2), 281-292
- Case, L. M. (1997).” An l¦ 1 penalty function approach to the nonlinear bilevel programming problem”.
- Colson, B., Marcotte, P., & Savard, G. (2005).” Bilevel programming: A survey”. 4or, 3(2), 87-107
- Edmunds, T. A., & Bard, J. F. (1991). “Algorithms for nonlinear bilevel mathematical programs”. IEEE transactions on Systems, Man, and Cybernetics, 21(1), 83-89
- Ghadimi, S., & Wang, M. (2018). “Approximation Methods for Bilevel Programming”. arXiv preprint arXiv:1802.02246.
- Hansen, P., Jaumard, B., & Sa-vard, G. (1992). “New branch-and-bound rules for linear bilevel programming”. SIAM Journal on scientific and Statistical Computing, 13(5), 1194-1217.
- Hosseini, E., & Kamalabadi, I. N. (2013).” Solving linear-quadratic bi-level programming and linear-fractional bi-level programming problems using genetic algorithm”. Applied Mathematics and Computational Intelligence, 2(2), 169-182
- Hosseini, E., & Kamalabadi, I. N. (2014). “Taylor approach for solving non-linear bi-level programming problem”. Advances in Computer Science: an International Journal, 3(5), 91-97.
- Hosseini, E., & Kamalabadi, I. N. (2015).” Bi-section algorithm for solving linear Bi-level programming problem”. Int. J. Sci. Eng, 1, 101-107.
- Hosseini, E., & Kamalabadi, I. N. (2015). “Two approach to solve nonlinear bilevelfor solving non-linear bi-level programming problem”. Advances in Computer Science: an International Journal
- Wan, Z., Mao, L., & Wang, G. (2014).” Estimation of distribution algorithm for a class of nonlinear bilevel programming problems”. Information Sciences, 256, 184-1967- Hosking, J.R.M. ,(1986), The theory of probability
