Abstract
In this paper, we develop new methods of local and global search for finding optimistic solutions to the hierarchical problem of optimal pricing in telecommunication networks. These methods are based on the fact that a bilevel optimization problem can be equivalently represented as a nonconvex optimization problem (with the help of the Karush–Kuhn–Tucker conditions and the penalty approach). To solve the resulting nonconvex problem, we apply the Global Search Theory (GST). Computational testing of the developed methods on a test problem demonstrated workability and efficiency of the approach proposed.
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.
