Abstract
Morton et al. [1] describe a greedy algorithm for solving a class of convex programming problems. The algorithm is validated by the use of polymatroid theory. In the present paper we establish the validity of the algorithm by a more elementary argument using the well known Karush-Kuhn-Tucker optimality conditions. In [1] it is shown that a variant of the above mentioned greedy algorithm solves a related quadratic programming problem. Here we show that the variant in fact solves a slightly more general problem.
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 callMore From: INFOR: Information Systems and Operational Research
Disclaimer: 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.
