Abstract
This article considers bilevel linear programming problems where the coefficients of the objective functions and the constraints in the problem are given as fuzzy parameters. Stackelberg solutions under fuzziness are defined by incorporating the notions of possibility theory into the original concept of Stackelberg solutions. It is shown that Stackelberg problems under fuzziness are transformed into deterministic bilevel linear or nonlinear programming problems, and that the resulting problems are exactly solved by using conventional bilevel linear or nonlinear programming techniques.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
