Addendum: A Finite Algorithm for Solving Nonlinear Allocation Problems

Published Online:https://doi.org/10.1287/moor.10.1.154

This note communicates two improvements to a finite allocation algorithm previously reported. The algorithm yields exact solutions to multi-resource allocation problems which have concave return functions. The first improvement permits one of the conditions on the return functions to be relaxed and the second improvement speeds up one of the steps of the algorithm.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.