Solving bi-level linear fractional programming problem by bi-level linear programming problem
Publish Year: 1393
نوع سند: مقاله کنفرانسی
زبان: English
View: 1,045
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
AEBSCONF01_028
تاریخ نمایه سازی: 6 آبان 1393
Abstract:
In this paper, we are going to solve bi-level linear fractional programming problem (BLFPP). Many approaches have been offered to solve the mentioned problem; however most of the suggested methods are just some techniques to solve the problem and they do not have a reliable theoretical background. In this paper, through expanding the variable transformation of Charnes and Cooper (1962), BLFPP will change to bi-level linear programming problem (BLPP). Considering that there are some efficient and theory-based algorithms to solve the BLPP, BLFPP is solvable, as well. In this paper, the k-th best method, which is one of the most applicable and popular methods to solve BLPP, is used as a technique to solve the obtained BLPP. A numerical example will be given, at the end, to explain the method.
Keywords:
Bi-level linear fractional programming problem (BLFPP) , Bi-level linear programming problem (BLPP) , Variable transformation , K-th best method
Authors
Ali Payan
Department of Mathematics, Zahedan Branch, Islamic Azad University, Zahedan, Iran
Sakine Keykha
Department of Mathematics, Zahedan Branch, Islamic Azad University, Zahedan, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :