Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Technical Note—Note on Constrained Maximization of a Sum

Technical Note—Note on Constrained Maximization of a Sum 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Operations Research INFORMS

Technical Note—Note on Constrained Maximization of a Sum

Washburn, Alan R.
Operations Research , Volume 29 (2): 4 – Apr 1, 1981
Download PDF
4 pages

Loading next page...
 
/lp/informs/technical-note-note-on-constrained-maximization-of-a-sum-J5bMpplSB9

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Technical Note
ISSN
0030-364X
eISSN
1526-5463
DOI
10.1287/opre.29.2.411
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Operations Research – INFORMS

Published: Apr 1, 1981

There are no references for this article.