World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A PENALTY METHOD FOR SOLVING BILEVEL LINEAR FRACTIONAL/LINEAR PROGRAMMING PROBLEMS

    https://doi.org/10.1142/S0217595904000205Cited by:7 (Source: Crossref)

    Bilevel programming involves two optimization problems where the constraint region of the first-level problem is implicitly determined by another optimization problem. This model has been applied to decentralized planning problems involving a decision process with a hierarchical structure. In this paper, we consider the bilevel linear fractional/linear programming problem, in which the objective function of the first-level is linear fractional, the objective function of the second level is linear, and the common constraint region is a polyhedron. For this problem, taking into account the relationship between the optimization problem of the second level and its dual, a global optimization approach is proposed that uses an exact penalty function based on the duality gap of the second-level problem.