An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems
DOI10.1080/00207721.2014.993348zbMath1347.49051OpenAlexW2090753820MaRDI QIDQ2822279
Hong Li, Yong-chang Jiao, Li Zhang
Publication date: 30 September 2016
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2014.993348
nonlinear programmingsmoothing functiondiscrete differential evolution algorithminteractive approachconstraint-handling techniqueinteger bilevel programming problem
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- Unnamed Item
- Solving quadratic convex bilevel programming problems using a smoothing method
- Recent approaches to global optimization problems through particle Swarm optimization
- Bilevel programming: a survey
- A review of particle swarm optimization. II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications
- Convex two-level optimization
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- A simple tabu search method to solve the mixed-integer linear bilevel programming problem
- A smoothing method for mathematical programs with equilibrium constraints
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- An efficient constraint handling method for genetic algorithms
- Discrete bilevel programming: application to a natural gas cash-out problem
- Algorithms for solving the mixed integer two-level linear programming problem
- Discrete linear bilevel programming problem
- One-level reformulation of the bilevel Knapsack problem using dynamic programming
- Solving bilevel programs with the KKT-approach
- An exact algorithm for bilevel 0-1 knapsack problems
- Global solution of nonlinear mixed-integer bilevel programs
- Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
- A review of particle swarm optimization. I: Background and development
- A novel approach to bilevel nonlinear programming
- Global optimization of mixed-integer bilevel programming problems
- A solution method for the static constrained Stackelberg problem via penalty method
- Bilevel programming with discrete lower level problems
- A new computational method for Stackelberg and min-max problems by use of a penalty method
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Smooth SQP Methods for Mathematical Programs with Nonlinear Complementarity Constraints
- The Mixed Integer Linear Bilevel Programming Problem
- A solution method for the linear static Stackelberg problem using penalty functions
This page was built for publication: An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems