(Winston, 1987) Williams, 1990) .Such Examples Will Be Formulated in This Review., (
(Winston, 1987) Williams, 1990) .Such Examples Will Be Formulated in This Review., (
(Winston, 1987) Williams, 1990) .Such Examples Will Be Formulated in This Review., (
1. INTRODUCTION
Since the development of the Simplex Algorithm by Dantzig in 1947, Linear
Programming (LP) has been used to solve optimization problems in various
industries. An extensive list of LP applications has been provided by Gass in his
bibliography (Gass, 1985). Many other authors have presented real life problems
which may be solved with LP techniques. Shapiro, for- example, describes actual
business case studies (Shapiro, 1984). See also (Hillier & Lieberman, 1986),
(Winston,1987) ,( Williams,1990).Such examples will be formulated in this review.
The formulation of real life problems into LP models has lead to the classification
of models into typical prototypes, eg: production; distribution; blending; manpower
planning; cutting stock; transportation; network; process-flow. Each of these classes
of models has intrinsic characteristics which demand particular modeling
techniques. Many real situations will involve a combination of these
prototype models and will therefore require a mixture of such techniques. Thus
the simple skills used for formulating these prototypes form the basis of LP
modelling. A compilation of basic prototype models follows in section two with
illustrative examples. Although these examples are formulated in this section in a
mathematical form, the models are not the most clearly defined. Thus a discussion
of model formulation and a more formal approach to model description follows in
section three. The basic prototype models may also be extended to deal with
multi-time periods or multi-locations. This is illustrated in section four. Section five
examines process flow models in more detail and section six describes network
models which due to their special structure may be solved with specialist
algorithms.
Example 2.la