A linear fractional bilevel programming problem with multichoice parameters
Abstract
A bilevel programming problem (BLPP) is a hierarchical optimization problem
where the constraint region of the upper level is implicitly determined by the lower level optimization problem. In this paper, a bilevel programming problem is considered in which the objective functions are linear fractional and the feasible region is a convex polyhedron. Linear fractional objectives in BLPP are useful in production planning, financial planning, corporate planning and so forth. Here, the cost coefficient of the objective functions are multi-choice parameters. The multi-choice parameters are replaced using interpolating polynomials. Then, fuzzy programming is used to find a compromise solution of the transformed
BLPP. An algorithm is developed to find a compromise solution of BLPP. The
method is illustrated with the help of an example.
Downloads
Published
Issue
Section
License
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
