Year-end Sale % OFF 
Abstract
A linearly constrained 0–1 quadratic programming problem is proved to be equivalent to a continuous concave quadratic problem with an easily computed penalty parameter. Moreover, it is proved that the feasibility of the former problem can be checked by solving the latter.
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.
