Abstract
The purpose of this note is to prove that the rules on which Theil and van de Panne [Theil, H., C. van de Panne. 1960. Quadratic programming as an extension of conventional quadratic maximization. Management Sci. 7(1) 1–20] based their recent method to follow straightforward from the well-known Kuhn-Tucker conditions and to propose a method for handling degeneracy in quadratic programming.
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.
