Abstract
Recently it was pointed out that the generalized Lagrange-multiplier method provides a sharper bound on a nonconvex program than does the solution of the program formed by taking convex envelopes of all functions involved in the original problem. This note points out that the bounds are the same if the original problem has only linear constraints, or if the problem is separable with certain properties, and give an example in which the bounds differ. The better bound is currently being used in locating global solutions of nonconvex, separable, piecewise-linear problems.
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.
