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

References (28)

  1. 1 Numerical optimization [DOI]
  2. 2 Numerical Optimization [DOI]
  3. 3 Descent approaches for quadratic bilevel programming [DOI]
  4. 4 A smoothing method for mathematical programs with equilibrium constraints [DOI]
  5. 5 Genetic algorithm based approach to bi-level linear programming [DOI]
  6. 6 Linear bilevel programming solution by genetic algorithm [DOI]
  7. 7 Fuzzy goal programming approach to multilevel programming problems [DOI]
  8. 8 An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions [DOI]
  9. 9 A hybrid intelligent algorithm by combining particle swarm optimization with chaos searching technique for solving nonlinear bilevel programming problems [DOI]
  10. 10 Non-Linear Programming [DOI]
  11. 11 Neural network for solving convex quadratic bilevel programming problems [DOI]
  12. 12 Interactive fuzzy programming for multilevel linear programming problems [DOI]
  13. 13 On the Karush–Kuhn–Tucker reformulation of the bilevel optimization problem [DOI]
  14. 14 A penalty function method based on Kuhn–Tucker condition for solving linear bilevel programming [DOI]
  15. 15 Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem [DOI]
  16. 16 Application of particle swarm optimization based on CHKS smoothing function for solving nonlinear bilevel programming problem [DOI]
  17. 17 Estimation of distribution algorithm for a class of nonlinear bilevel programming problems [DOI]
  18. 18 One-level reformulation of the bilevel Knapsack problem using dynamic programming [DOI]
  19. 19 A neural network approach for solving linear bilevel programming problem [DOI]
  20. 20 Interactive fuzzy decision making method for solving bilevel programming problem [DOI]
  21. 21 A new method for solving fully fuzzy linear Bilevel programming problems
  22. 22 An augmented Lagrangian multiplier method based on a CHKS smoothing function for solving nonlinear bilevel programming problems [DOI]
  23. 23 Global convergent algorithm for the bilevel linear fractional-linear programming based on modified convex simplex method [DOI]
  24. 24 Stackelberg solutions for random fuzzy two-level linear programming through possibility-based probability model [DOI]
  25. 25 Global Optimization Method for Solving Mathematical Programs with Linear Complementarity Constraints [DOI]
  26. 26 An Interactive Fuzzy Decision Making Method for a Class of Bilevel Programming [DOI]
  27. 27 A genetic algorithm approach to fuzzy quadratic bilevel programming [DOI]
  28. 28 A Genetic Approach for Solving Bi-Level Programming Problems

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.

10

Page views

0

PDF downloads

1

Outbound clicks

8

Citations

Views over time

Views by country

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

Traffic sources

Referring site, by host.

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.