2. Linear Programming: Allocation, Covering, and Blending Models
Published Online: 7 MAR 2011
Copyright © 2011 John Wiley & Sons, Inc.
Optimization Modeling with Spreadsheets, Second Edition
How to Cite
Baker, K. R. (2011) Linear Programming: Allocation, Covering, and Blending Models, in Optimization Modeling with Spreadsheets, Second Edition, John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470949108.ch2
- Published Online: 7 MAR 2011
- Published Print: 4 APR 2011
Print ISBN: 9780470928639
Online ISBN: 9780470949108
- business decision;
This chapter introduces three classes of linear programming models: allocation, covering, and blending. To some extent, these elementary models allow us to discuss the basic scenarios that lend themselves to linear programming models, so allocation, covering, and blending models might well be taken as the “ABC” of model building with linear programming. Allocation, covering and blending models are also important as building blocks for more complex models because many practical applications are combinations of these structures. Linearity in both the objective function and constraints is the key structural assumption in linear programming. In the process of building a linear programming model, it is desirable to revisit the requirements of proportionality, additivity, and divisibility, to confirm that their properties apply. The chapter analyzes new situations by recognizing familiar structures within them, thus identifying some of the important elements (decision variables and constraints) of the eventual model.
Controlled Vocabulary Terms
Constraints; Linear programming