Open AccessBook
Operations Research: Deterministic Optimization Models
Reads0
Chats0
TLDR
The Hungarian Method: A Primal-Dual Method for the Assignment Problem and Heuristic Methods for Combinatorial Optimization Problems are reviewed.Abstract:
1. Introduction. 2. Modeling Linear Programs. 3. Review of Matrix Algebra and Geometry. 4. Duality and Optimality Conditions in LP. 5. Hungarian Method: A Primal-Dual Method for the Assignment Problem. 6. Primal Algorithm for the Transportation Problem. 7. The Simplex Method for General LP. 8. Algorithms for Multiobjective Models. 9. Modeling Integer and Combinatorial Programs. 10. The Branch and Bound Approach. 11. Heuristic Methods for Combinatorial Optimization Problems. 12. Dynamic Programming. 13. Critical Path Methods in Project Management. 14. Nonlinear Programming. Index.read more
Citations
More filters
Journal ArticleDOI
Evolutionary structural optimisation (ESO) using a bidirectional algorithm
TL;DR: In this article, the authors combine the basic ESO with the additive evolutionary structural optimisation (AESO) to produce bidirectional ESO whereby material can be added and can be removed.
Journal ArticleDOI
A Minimax Portfolio Selection Rule with Linear Programming Solution
TL;DR: In this paper, the optimal portfolio is chosen that minimizes the maximum loss over all past observation periods, for a given level of return, using minimum return rather than variance as a measure of risk.
A DSS (Decision Support System) for Operations in a Container Terminal
TL;DR: The mathematical models and algorithms used in designing the DSS, the reasons for using these approaches, and some experimental results are discussed.
Journal ArticleDOI
A Learning Theoretic Approach to Energy Harvesting Communication System Optimization
TL;DR: A point-to-point wireless communication system in which the transmitter is equipped with an energy harvesting device and a rechargeable battery, is studied and the performance loss due to the lack of the transmitter's information regarding the behaviors of the underlying Markov processes is quantified.
Journal ArticleDOI
Hierarchical analysis of power distribution networks
TL;DR: This paper presents a new technique for analyzing a power grid using macromodels that are created for a set of partitions of the grid, and shows that even for a 60 million-node power grid, the approach allows for an efficient analysis, whereas previous approaches have been unable to handle power grids of such size.