On linear bilevel problems with multiple objectives at the lower level
Bilevel programming problems provide a framework to deal with decision processes involving two decision makers with a hierarchical structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper level problem is implicitly determined by the lower level optimization problem. This paper focuses on bilevel problems for which the lower level problem is a linear multiobjective program and constraints at both levels define polyhedra. This bilevel problem is reformulated as an optimization problem over a nonconvex region given by a union of faces of the polyhedron defined by all constraints. This reformulation is obtained when dealing with efficient solutions as well as weakly efficient solutions for the lower level problem. Assuming that the upper level objective function is quasiconcave, then an extreme point exists which solves the problem. An exact and a metaheuristic algorithm are developed and their performance is analyzed and compared.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 39 (2011)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kunsch, P.L. & Kavathatzopoulos, I. & Rauschmayer, F., 2009. "Modelling complex ethical decision problems with operations research," Omega, Elsevier, vol. 37(6), pages 1100-1108, December.
- Bard, Jonathan F, 1983. "Coordination of a multidivisional organization through two levels of management," Omega, Elsevier, vol. 11(5), pages 457-468.
- Wayne F. Bialas & Mark H. Karwan, 1984. "Two-Level Linear Programming," Management Science, INFORMS, vol. 30(8), pages 1004-1020, August.
- Ankhili, Z. & Mansouri, A., 2009. "An exact penalty on bilevel programs with linear vector optimization lower level," European Journal of Operational Research, Elsevier, vol. 197(1), pages 36-41, August.
- Calvete, Herminia I. & Gale, Carmen & Mateo, Pedro M., 2008. "A new approach for solving linear bilevel problems using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 188(1), pages 14-28, July.
- Walker, Warren E., 2009. "Does the best practice of rational-style model-based policy analysis already include ethical considerations?," Omega, Elsevier, vol. 37(6), pages 1051-1062, December.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:39:y:2011:i:1:p:33-40. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.