Technical Note—Note on Constrained Maximization of a Sum

Published Online:https://doi.org/10.1287/opre.29.2.411

Use of a Lagrange multiplier in optimization problems often requires a search with the object of finding the multiplier for which some constraint is met. We introduce a technique that, under some severe assumptions, finds the correct multiplier in a finite number of steps.

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.