Solving Linear Bilevel Programming Problems Using a Binary Differential Evolution

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 2015Publisher:IEEEJournal:2015 11th International Conference on Computational Intelligence and Security (CIS)

Authors: Hong Li; Li Zhang;

doi: 10.1109/cis.2015.18

Solving Linear Bilevel Programming Problems Using a Binary Differential Evolution

- Summary
- Metrics

Abstract

A linear bilevel programming problem can be reformulated as a single level mathematical program with complementarity constraints, which in turn is equivalent to a mixed integer (0-1) linear programming problem. A binary differential evolution algorithm with a linear programming solver is developed to solve the mixed integer (0-1) linear programming problem. The computational results show the efficiency of the proposed algorithm.

Related Organizations

Xidian University
China (People's Republic of)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	3
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average