Abstract

In a bi-level programming, coefficients in the objective functions and the constraints may not to be fixed real numbers due to the presence of uncertainties in the domain of the model. This paper develops a methodology to solve these type bi-level programming problems whose parameters in the upper and lower level objective functions and constraints vary in intervals. A methodology is derived to find a compromising solution. The methodology is illustrated through numerical example.

Full Text
Paper version not known

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 call

Disclaimer: 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.