Abstract
Disjoint bilinear programming has appeared in miscellaneous practical applications. Although deterministic approaches such as cutting plane methods for solving it have been proposed, the frequently encountered computational problem regarding degeneracy still remains. This paper proposes a distance-following approach in order to generate a conservative hyperplane from a degenerate local star minimizer located by the augmented mountain climbing procedure, cut off it, and thus enable a cutting plane method to proceed without too much additional computational workload.
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.
