Professional Documents
Culture Documents
Linear Programming:
Model Formulation and
Graphical Solution
BIT 2406
Chapter Topics
Model Formulation
A Maximization Model Example
Graphical Solutions of Linear
Programming Models
A Minimization Model Example
Irregular Types of Linear Programming
Models
Characteristics of Linear Programming
Problems
BIT 2406
Linear Programming
Objectives of business decisions frequently involve
maximizing profit or minimizing costs.
Linear Programming is a model that consists of linear
relationships representing a firms decision(s), given an
objective and resource constraints.
Three Steps in Applying the Linear Programming
Technique:
Identify the problem as being solvable by linear
programming
Formulate the unstructured problem as a mathematical
model
Solve the model using established mathematical
techniques
BIT 2406
Model Components
Decision Variables are mathematical
symbols that represent levels of activity.
Objective Function a linear relationship
that reflects the objective of an operation,
in terms of the decision variables this
function is to be maximized or minimized.
Constraint a linear relationship that
represents a restriction on decision making.
Parameters numerical values that are
included in the objective functions and
constraints.
BIT 2406
Problem Statement:
Beaver Creek Pottery Company is a small crafts operation
run by a Native American tribal council. The company
employs skilled artisans to produce clay bowls and mugs
with authentic Native American design and colors. The two
primary resources used by the company are special pottery
clay and skilled labor. Given these limited resources, the
company desires to know how many bowls and mugs to
produce each day in order to maximize profit. Each bowl
requires 1 hour of labor and 4 lbs of clay, and sells for $40.
Each mug requires 2 hours of labor and 3 lbs of clay, and
sells for $50. There are 40 hours of labor and 120 pounds of
clay available each day for production.
BIT 2406
BIT 2406
Bowl
Mug
Profit ($/Unit)
Labor (Hr./Unit)
Clay (Lb./Unit)
Decision Variables
:
Objective
:
Resource
:
Availability
: 120 lbs
BIT 2406
Decision
Variables:
Objective
Function:
Resource
Constraints:
Non-Negativity
Constraints*:
BIT 2406
10
A Maximization Model
Example:
Product Mix Problem
BIT 2406
11
Graphical Solutions of LP
Models
Graphical solutions are limited to linear programming
problems with only two decision variables.
Can be used with 3 decision variables but cumbersome.
Graphical methods provide visualization of how a solution
for a linear programming problem is obtained.
Graphs provide a clearer understanding of how the
computer and mathematical solution approaches work.
BIT 2406
12
Formula of a Line
BIT 2406
13
Labor Constraint
BIT 2406
14
Clay Constraint
BIT 2406
15
Feasible Region
BIT 2406
16
Objective Line
BIT 2406
17
Optimal Solution
BIT 2406
18
Optimal Solution
Coordinates
BIT 2406
19
BIT 2406
20
BIT 2406
21
Graphical Solutions of LP
Models
If the objective function coefficients are
changed, the solution may change.
If the constraint coefficients are changed,
the solution space and solution points may
change.
Sensitivity analysis is used to analyze
changes in model parameters.
BIT 2406
22
Slack Variables
A Slack Variable is
added to a
constraint to convert
it to an equation (=).
A Slack Variable
represents unused
resources.
A Slack Variable
contributes nothing
to the objective
function.
BIT 2406
23
BIT 2406
24
25
A Minimization Model
Example
Problem Statement:
A farmer is preparing to plant a crop in the spring and
needs to fertilize a field at a minimum possible cost. There
are two brands of fertilizer to choose from, Super-gro and
Crop-quick. Super-gro yields 2 lbs of nitrogen and 4 lbs of
phosphate per bag, which costs $6. Crop-quick yields 4 lbs
of nitrogen and 3 lbs of phosphate and costs $3. The
farmers field requires at least 16 lbs of nitrogen and at
least 24 lbs of phosphate.
BIT 2406
26
A Minimization Model
Example
BIT 2406
27
Brand
Super-gro
Crop-quick
Cost ($/Bag)
Nitrogen
(Lb./Bag)
Phosphate
(Lb./Bag)
Decision Variables
: How many bags of each brand to purchase
Objective
: Minimize the total cost of fertilizing.
Field
: 16 lbs of nitrogen
Requirements: 24 lbs of phosphate
BIT 2406
28
A Minimization Model
Example
Decision
Variables:
Objective
Function:
Model
Constraints:
Non-Negativity
Constraints*:
29
Graphical Solution
Feasible Region
BIT 2406
30
Graphical Solution
Objective Function
BIT 2406
31
Surplus Variables
A Surplus Variable is
subtracted from a
constraint to convert
it to an equation (=).
A Surplus Variable
represents an excess
above a constraint
requirement level.
A Surplus Variable
contributes nothing to
the objective function.
BIT 2406
32
BIT 2406
33
BIT 2406
34
BIT 2406
35
Infeasible Problem
maximize Z 5 x1 3x2
subject to
4 x1 2 x2 8
x1 4
x2 6
x1 , x2 0
BIT 2406
36
Unbounded Problem
maximize Z 4 x1 2 x2
subject to
x1 4
x2 2
x1 , x2 0
BIT 2406
37
Characteristics of LP Problems
A linear programming problem requires a
decision - a choice amongst alternative courses
of action.
The decision is represented in the model by
decision variables.
The problem encompasses a goal, expressed as
an objective function, that the decision maker
wants to achieve.
Restrictions (Constraints) exist that limit the
extent of achievement of the objective.
The objective and constraints must be definable
by linear mathematical functional relationships.
BIT 2406
38
39