مقارنة خوارزمية التفريع و التحديد مع طريقة تايلور لحل البرمجة غير الخطية ثنائية المستوى مع تطبيق عملي

Abstract EN

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.