The DOI matches its Crossref record.
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
Abstract
The usefulness of Lagrange multipliers for optimization in the presence of constraints is not limited to differentiable functions. They can be applied to problems of maximizing an arbitrary real valued objective function over any set whatever, subject to bounds on the values of any other finite collection of real valued functions denned on the same set. While the use of the Lagrange multipliers does not guarantee that a solution will necessarily be found for all problems, it is “fail-safe” in the sense that any solution found by their use is a true solution. Since the method is so simple compared to other available methods it is often worth trying first, and succeeds in a surprising fraction of cases. They are particularly well suited to the solution of problems of allocating limited resources among a set of independent activities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Rate-constrained coder control and comparison of video coding standards
Wiegand, T., Schwarz, H., Joch, A., Kossentini, F., & Sullivan, G. J. (2003) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2003.815168 · Cited by 3,146
High performance scalable image compression with EBCOT
Taubman, D. (2000) · IEEE Transactions on Image Processing · doi:10.1109/83.847830 · Cited by 1,941
Rate-distortion optimization for video compression
Sullivan, G. J., & Wiegand, T. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733497 · Cited by 1,727
Ohm, J.-R., Sullivan, G. J., Schwarz, H., Tan, T. K., & Wiegand, T. (2012) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2012.2221192 · Cited by 1,279
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Lagrangean relaxation for integer programming
Geoffrion, A. M. (1974) · Mathematical Programming Studies · doi:10.1007/bfb0120690 · Cited by 1,111
Lagrangian Relaxation for Integer Programming
Geoffrion, A. M. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_9 · Cited by 974
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Efficient bit allocation for an arbitrary set of quantizers (speech coding)
Shoham, Y., & Gersho, A. (1988) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.90373 · Cited by 831
A Genetic Algorithm for the Multidimensional Knapsack Problem
Chu, P. C., & Beasley, J. E. (1998) · Journal of Heuristics · doi:10.1023/a:1009642405419 · Cited by 828
Rate-distortion methods for image and video compression
Ortego, A., & Ramchandran, K. (1998) · IEEE Signal Processing Magazine · doi:10.1109/79.733495 · Cited by 808
A survey of maintenance models: The control and surveillance of deteriorating systems
Pierskalla, W. P., & Voelker, J. A. (1976) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800230302 · Cited by 678
Video Compression - From Concepts to the H.264/AVC Standard
Sullivan, G. J., & Wiegand, T. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.839617 · Cited by 538
Tseng, P. (1991) · SIAM Journal on Control and Optimization · doi:10.1137/0329006 · Cited by 467
Privacy-Preserved Data Sharing Towards Multiple Parties in Industrial IoTs
Zheng, X., & Cai, Z. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2980802 · Cited by 462
Parallel Multi-Block ADMM with o(1 / k) Convergence
Deng, W., Lai, M.-J., Peng, Z., & Yin, W. (2017) · Journal of Scientific Computing · doi:10.1007/s10915-016-0318-2 · Cited by 455
Towards a more rigorous and practical unit commitment by Lagrangian relaxation
Zhuang, F., & Galiana, F. D. (1988) · IEEE Transactions on Power Systems · doi:10.1109/59.192933 · Cited by 453
A New Method for Unit Commitment at Electricite De France
Merlin, A., & Sandrin, P. (1983) · IEEE Transactions on Power Apparatus and Systems · doi:10.1109/tpas.1983.318063 · Cited by 419
Optimal maintenance models for systems subject to failure–A Review
Sherif, Y. S., & Smith, M. L. (1981) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800280104 · Cited by 409
Fast approximate energy minimization with label costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539897 · Cited by 404
Fast Approximate Energy Minimization with Label Costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0437-z · Cited by 381
Electric eel foraging optimization: A new bio-inspired optimizer for engineering applications
Zhao, W., Wang, L., Zhang, Z., Fan, H., Zhang, J., Mirjalili, S., Khodadadi, N., & Cao, Q. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122200 · Cited by 318
Capital Budgeting of Interrelated Projects: Survey and Synthesis
Weingartner, H. M. (1966) · Management Science · doi:10.1287/mnsc.12.7.485 · Cited by 296
A survey of the search theory literature
Benkoski, S. J., Monticino, M. G., & Weisinger, J. R. (1991) · Naval Research Logistics · doi:10.1002/1520-6750(199108)38:4<469::aid-nav3220380404>3.0.co;2-e · Cited by 278
Hasani, A., & Khosrojerdi, A. (2016) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2015.12.009 · Cited by 272
Relaxations of Weakly Coupled Stochastic Dynamic Programs
Adelman, D., & Mersereau, A. J. (2008) · Operations Research · doi:10.1287/opre.1070.0445 · Cited by 198
Metadata
- Authors
- Everett, H.
- Venue
- Operations Research
- Published
- 1963-06
- Volume
- 11
- Issue
- 3
- Pages
- 399-417
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2069277547
- Cited by
- 1,274
- References
- 0
- FWCI
- 12.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.