Skip to content
Research Article Open access CC BY 4.0

Two Approaches for Solving Non-linear Bi-level Programming Problem

Eghbal Hosseini, Isa Nakhai Kamalabadi

Advances in Research · pp. 512–525 · Published 6 Dec 2014

10.9734/AIR/2015/14195

Abstract

In the recent years, the bi-level programming problem (BLPP) is interested by many researchers and it is known as an tool to solve the real problems in several areas such as economic, traffic, finance, management, and so on. Also, it has been proven that the general BLPP is an NP-hard problem. In this paper, we attempt to develop two effective approaches, one based on approximate approach and the other based on the hybrid algorithm by combining the penalty function and the line search algorithm for solving the non-linear BLPP. In these approaches, by using the Karush-Kuhn-Tucker conditions the BLPP is converted to a non-smooth single problem, and then it is smoothed by Fischer-Burmeister functions. Finally, the smoothed problem is solved using both of the proposed approaches. The presented approaches achieve an efficient and feasible solution in an appropriate time which has been evaluated by comparing to references and test problems.  

Non-linear bi-level programming problem approximate method karush-kuhn-tucker conditions line search method

Cited by 8

Tri-Level Model for Hybrid Renewable Energy Systems

Eghbal Hosseini · arXiv.org · 2023

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

8

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.