Abstract
The problem is investigated of weighted sum maximization of a given finite set of vectors from the finite-dimensional vector space ℝ k . Polynomial algorithms solving it are presented and analyzed in the case when a finite polyhedral norm or the l 2 norm is defined on ℝ k .
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.
