On the choice of the penalty parameter for discrete-continuous linear bi-level problems reformulation
by Massimiliano Caramia; Renato Mari
International Journal of Mathematics in Operational Research (IJMOR), Vol. 7, No. 1, 2015

Abstract: In this paper we focus on linear bi-level problems in which the variables controlled by the leader are discrete. It is known that such problems are equivalent to continuous linear bi-level problems in which the integrality requirements are relaxed and the leader's objective function is modified including a concave penalty function weighted by a parameter µ. The equivalence holds for a sufficiently large value of µ. A valid lower bound for µ is known in the literature. In the following, we provide an improvement of this lower bound and experiment the new lower bound on a set of test problems.

Online publication date: Mon, 12-Jan-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com