The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Decomposition techniques in mathematical programming: engineering and science applications
Abstract
Optimization plainly dominates the design, planning, operation, and control of engineering systems.This is a book on optimization that considers particular cases of optimization problems, those with a decomposable structure that can be advantageously exploited.Those decomposable optimization problems are ubiquitous in engineering and science applications.The book considers problems with both complicating constraints and complicating variables, and analyzes linear and nonlinear problems, with and without integer variables.The decomposition techniques analyzed include Dantzig-Wolfe, Benders, Lagrangian relaxation, Augmented Lagrangian decomposition, and others.Heuristic techniques are also considered.Additionally, a comprehensive sensitivity analysis for characterizing the solution of optimization problems is carried out.This material is particularly novel and of high practical interest.This book is built based on many clarifying, illustrative, and computational examples, which facilitate the learning procedure.For the sake of clarity, theoretical concepts and computational algorithms are assembled based on these examples.The results are simplicity, clarity, and easy-learning.We feel that this book is needed by the engineering community that has to tackle complex optimization problems, particularly by practitioners and researchers in Engineering, Operations Research, and Applied Economics.The descriptions of most decomposition techniques are available only in complex and specialized mathematical journals, difficult to understand by engineers.A book describing a wide range of decomposition techniques, emphasizing problem-solving, and appropriately blending theory and application, was not previously available.The book is organized in five parts.Part I, which includes Chapter 1, provides motivating examples and illustrates how optimization problems with decomposable structure are ubiquitous.Part II describes decomposition theory, algorithms, and procedures.Particularly, Chapter 2 and 3 address solution procedures for linear programming problems with complicating constraints and complicating variables, respectively.Chapter 4 reviews and summarizes
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
Cites
Mixed Integer Nonlinear Programming
Floudas, C. A. (2008) · Encyclopedia of Optimization · doi:10.1007/978-0-387-74759-0_394 · Cited by 93
Cited by
Peer-to-peer and community-based markets: A comprehensive review
Sousa, T., Soares, T., Pinson, P., Moret, F., Baroche, T., & Sorin, E. (2019) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2019.01.036 · Cited by 936
Robust Energy Management for Microgrids With High-Penetration Renewables
Zhang, Y., Gatsis, N., & Giannakis, G. B. (2013) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2013.2255135 · Cited by 798
Distributed Control Techniques in Microgrids
Yazdanian, M., & Mehrizi-Sani, A. (2014) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2337838 · Cited by 727
A bilevel model for electricity retailers' participation in a demand response market environment
Zugno, M., Morales, J. M., Pinson, P., & Madsen, H. (2013) · Energy Economics · doi:10.1016/j.eneco.2012.12.010 · Cited by 321
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
A Comprehensive Battery Energy Storage Optimal Sizing Model for Microgrid Applications
Alsaidan, I., Khodaei, A., & Gao, W. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2017.2769639 · Cited by 312
Jia, Z., Sheng, M., Li, J., Niyato, D., & Han, Z. (2021) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.3021255 · Cited by 271
Nick, M., Cherkaoui, R., & Paolone, M. (2018) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2017.2734942 · Cited by 200
Metadata
- Venue
- Choice Reviews Online
- Publisher
- American Library Association
- Published
- 2006-12-01
- Volume
- 44
- Issue
- 04
- Pages
- 44-2155-44-2155
- ISSN
- 0009-4978 (ISSN-L)
- 1523-8253
- OpenAlex
- W1564243655
- Cited by
- 467
- References
- 1
- Type
- book review
- 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.