Abstract
The prime concern in this paper is the interface between efficient solutions and rational reaction sets in multilevel programming. It is shown that there need be no rational reaction solution which is also efficient, although in the bilevel case such a solution always exists, and in the generalK-level case such a solution exists if certain conditions hold. Some theoretical properties of an extension of known methods for generating efficient solutions are given, which are important algorithmically.
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.
