The purpose of this study is to determine if the problem of
scheduling instructors to classes can be formulated as a linear
program involving integer variables limited to values of zero and
one. Once such a formulation is accomplished, attempts at electronic computer solution of the problem are considered.
Specifically,...
This thesis presents a linear programming package that uses an
algorithm and data storage method efficient enough to solve a medium
sized linear programming problem (250 variables and 100 constraints)
on a minicomputer with small core memory space (4000 bytes).
In this routine the problem is formulated by the use...
It is the hope and expectation of many specialists in the area of linear programming that a major improvement in solution techniques for handling large-scale models with thousands of constraints will be developed in the near future. Although the present state of the art for solving linear programs is still...
Several problems relating to linear programming modeling have
been identified: (1) model formulation, validation and explanation
are difficult and time consuming; (2) models must be frequently
updated and debugged; (3) flexibility is needed to specify the model
schema for a class of problems as a group; and (4) significant
differences...
A key problem managers face is how to allocate scarce
resources among various activities or projects. Linear
programming, or LP, is a method of allocating resources
in an optimal way. It is one of the most widely used operations
research tools and has been a decision making aid in almost...
It is the purpose of this study to examine some statistically-oriented considerations which may facilitate
portfolio selection policies. Many of the preliminary
topics discussed parallel and extend the notions of
W. J. Baumol, H. M. Markowitz, and W. F. Sharpe.
The crux of the study introduces a quadratic programming
algorithm...
This thesis presents a general model for the location problem
based on integer linear programming with fixed charges. The location
problem is concerned with choosing locations for facilities
throughout a particular region or area in such a way that total costs
and expenses incurred are minimized. Although the location problem...
Linear programming is a recent development in the field of Mathematics having its origin in the past seventy-five years. The purpose of this study was to identify several methods for solving linear programming problems. The algorithm for each of the methods is described in detail along with an analysis of...
A key problem faced by managers is how to allocate scarce resources
among activities or projects. Linear programming, or LP, is a method of
allocating resources in an optimal way. It is one of the most widely used operations research (OR) tools. It has been used successfully as a decisionmaking...