Document Type

Article

Abstract

This paper presents a new mathematical model for bilevel linear programming problems (BLPPs). A new kind of constraint is proposed to emphasis the pre-determined hierarchy in the bilevel decisionmaking process. The solution to the BLPPs based on this new model is defined. A number of simple examples of BLPPs have been solved using the new model. It has been shown that the new model is able to handle a wider range of BLPPs.

Download

Share

COinS