Abstract
In many decentralized organizations, resource planning with sequential decision making can be formulated as a multi-level programming problem. In such cases, the decision variables are partitioned among the decision makers. Each of the decision makers optimizes his/her own objective function. This paper presents an algorithm using parametric analysis to solve a typical kind of nonlinear integer multilevel programming problems, called separable integer monotone bilevel programming (SIMBP), and then extends the algorithm for solving a parametric SIMBP problem. A numerical example with application of reliability optimization is given to illustrate the solution method.
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.
