An Evolutionary Algorithm Using Duality-Base-Enumerating Scheme for Interval Linear Bilevel Programming Problems

Hecheng Li and Lei Fang

Mathematical Problems in Engineering, 2014, vol. 2014, 1-8

Abstract:

Interval bilevel programming problem is hard to solve due to its hierarchical structure as well as the uncertainty of coefficients. This paper is focused on a class of interval linear bilevel programming problems, and an evolutionary algorithm based on duality bases is proposed. Firstly, the objective coefficients of the lower level and the right-hand-side vector are uniformly encoded as individuals, and the relative intervals are taken as the search space. Secondly, for each encoded individual, based on the duality theorem, the original problem is transformed into a single level program simply involving one nonlinear equality constraint. Further, by enumerating duality bases, this nonlinear equality is deleted, and the single level program is converted into several linear programs. Finally, each individual can be evaluated by solving these linear programs. The computational results of 7 examples show that the algorithm is feasible and robust.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2014/737515.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2014/737515.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:737515

DOI: 10.1155/2014/737515

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().