Beruflich Dokumente
Kultur Dokumente
Basic Concepts
Linear Programming is a method of dealing with
decision problems that can be expressed as
constrained linear models.
It is a mathematical technique for finding the best
uses of an organizations resources.
Linear Programming is initially referred as
programming in a linear structure.
Basic Concepts
In 1948, Tjalling
Koopmans
suggested to George
Dantzig to shorten it
to linear
programming.
Basic Concepts
Linear Programming was
developed by George
Dantzig in the 1940s, as a
result of Air Force research
project concerned with
computing the most
efficient and economical
way to distribute men,
weapons, and supply from
different fronts during
World War II.
Basic Concepts
The word programming means producing a plan
or procedure that determines the solution to a
problem.
Graphical Solution Method is a two-dimensional
geometric analysis of Linear Programming problems
with two decision variables.
Basic Concepts
The Theory of Linear Programming states that the
optimal solution will lie at a corner point of the
feasible region.
In large Linear Programming problems, the feasible
region cannot be easily graphed because it has many
dimensions (hyperspace), but the concept is the
same.
Legal
+ or
+ =
Antibiotic
Resource Requirement
Minimum
Requirement
Ingredient A
Ingredient B
Antibiotic 1
3 units
1 unit
Antibiotic 2
1 unit
1 unit
Antibiotic 3
2 units
6 units
12
Maximize: = 6 + 4
Subject to: 3 + 2 18
2 + 4 = 20
2 8
, 0
Minimize: C = 6 + 4
Subject to: 3 + 2 18
2 + 4 = 20
2 8
, 0