Академический Документы
Профессиональный Документы
Культура Документы
SOLUTION TECHNIQUES:
GRAPHICAL AND
COMPUTER METHODS
INTENDED LEARNING OUTCOMES
Understand basic assumptions and properties of linear
programming (LP).
Use graphical solution procedures for LP problems with
only two variables to understand how LP problems are
solved.
Understand special situations such as redundancy,
infeasibility, unboundedness, and alternate optimal
solutions in LP problems.
Understand how to set up LP problems on a spreadsheet
and solve them using Excel’s solver.
INTRODUCTION
Management decisions in many organizations involve trying
to make most effective use of resources (machinery, labor,
money, time, warehouse space, and raw materials) in order
to:
Produce products - such as computers, automobiles, or
clothing or
Provide services - such as package delivery, health
services, or investment decisions.
To solve problems of resource allocation one may use
mathematical programming.
LINEAR PROGRAMMING
Linear programming (LP) is the most common type of
mathematical programming.
LP seeks to maximize or minimize a linear objective
function subject to a set of linear constraints
LP assumes all relevant input data and parameters are
known with certainty (deterministic models).
Computers play an important role in the solution of LP
problems
LP MODEL COMPONENTS AND
FORMULATION
Decision variables - mathematical symbols representing
levels of activity of a firm.
Objective function - a linear mathematical relationship
describing an objective of the firm, in terms of decision
variables, that is to be maximized or minimized
Constraints - restrictions placed on the firm by the
operating environment stated in linear relationships of
the decision variables.
Parameters - numerical coefficients and constants used
in the objective function and constraint equations.
DEVELOPMENT OF A LP MODEL
LP applied extensively to problems areas -
medical, transportation, operations,
financial, marketing, accounting,
human resources, and agriculture.
Development and solution of all LP models can be
examined in a four step process:
(1) identification of the problem as solvable by LP
(2) formulation of the mathematical model.
(3) solution.
(4) interpretation.
BASIC STEPS OF DEVELOPING A LP
MODEL
Formulation
– Process of translating problem scenario into simple LP model
framework with a set of mathematical relationships.
Solution
– Mathematical relationships resulting from formulation process are
solved to identify optimal solution.
Interpretation and What-if Analysis
– Problem solver or analyst works with the manager to
interpret results and implications of problem solution.
investigate changes in input parameters and model variables
and impact on problem solution results.
LINEAR EQUATIONS AND
INEQUALITIES
This is a linear equation:
2A + 5B = 10
This equation is not linear:
2A2 + 5B3 + 3AB = 10
LP uses, in many cases, inequalities like:
A+BC or A+BC
BASIC ASSUMPTIONS OF A LP MODEL
50
40
30
20
Coordinates
for graphical
10
analysis
0 10 20 30 40 50 60
GRAPHICAL REPRESENTATION OF
CONSTRAINTS:
COORDINATE AXES-BEAVER CREEK
EXAMPLE (6 of 18)
Carpentry time
constaint
4T + 3C 240
GRAPHICAL REPRESENTATION OF
CONSTRAINTS:
FLAIR FURNITURE EXAMPLE (9 of 19)
Carpentry Time
Constraint
Carpentry time and
(feasibleregion
the feasible area)
Painting Time
Constraint and the
Feasible Area
2T + 1C 100
Chair Limit
Constraint and the
Feasible Solution
Area
Feasible solution
area is constrained
by three limiting
lines
ISOPROFIT LINE SOLUTION METHOD:
FLAIR FURNITURE EXAMPLE (12 of 19)
Isoprofit lines
($210, $280,
$350) are all
parallel.
ISOPROFIT LINE SOLUTION METHOD:
FLAIR FURNITURE EXAMPLE (16 of 19)
Optimal Solution:
Corner Point 4: T=30 (tables) and C=40 (chairs) with $410 profit
ISOPROFIT LINE SOLUTION METHOD:
FLAIR FURNITURE EXAMPLE (17 of 19)
Optimal solution occurs at the maximum point in the
feasible region.
It occurs at the intersection of carpentry and painting
constraints:
- Carpentry constraint equation: 4T + 3C = 240
- Painting constraint equation : 2T + 1C = 100
If one solves these two equations with two unknowns for T
and C (for Corner Point 4), Optimal Solution is found:
T=30 (tables) and C=40 (chairs) with $410 profit.
CORNER POINT SOLUTION METHOD:
FLAIR FURNITURE EXAMPLE (18 of 19)
From the figure one knows
that the feasible region
for Flair’s problem has
five corner points,
namely, 1, 2, 3, 4, and
5, respectively.
Point 2 (T = 0, C = 60)
profit = $7(0) + $5(60) = $300
Point 5 (T = 50, C = 0)
profit = $7(50) + $5(0) = $350 .
PROBLEM DEFINITION:
THE GALAXY INDUSTRIES EXAMPLE
(1 of 9)
Galaxy manufactures two toy models:
– Space Ray.
– Zapper.
Decision variables:
– X1 = Production level of Space Rays (in dozens per
week).
– X2 = Production level of Zappers (in dozens per week).
Objective Function:
Production mix
Production Feasible constraint:
Time X1-X2<=450
3X1+4X2<=2400 600
X1
Boundary points.
800
Interior points.
• There are three types of feasible points
Extreme points.
SOLVING GRAPHICALLY FOR AN
OPTIMAL SOLUTION
ISOPROFIT LINE SOLUTION METHOD:
GALAXY INDUSTRIES EXAMPLE (7 of 9)
We now demonstrate the search for an optimal solution
Start
1200 atX2some arbitrary profit, say profit = $2,000...
Then increase the profit, if possible...
...and continue until it becomes infeasible
Profit
Profit =$5040
4,
= $ 3,
2,
800
000
600
X1
600
Feasible
Feasible
region
region
X1
400 600 800
OPTIMAL SOLUTION:
GALAXY INDUSTRIES EXAMPLE (9 of 9)
Space Rays = 480 dozens
Zappers = 240 dozens
Profit = $5040
– This solution utilizes all the plastic and all the production
hours.
Nitrogen Phosphate
Brand
(lb/bag) (lb/bag)
Super-gro 2 4
Crop-quick 4 3
PROBLEM DEFINITION:
FERTILIZER MIX EXAMPLE (2 of 7)
Decision Variables:
x1 = bags of Super-Gro
x2 = bags of Crop-Quick
Model Constraints:
2x1 + 4x2 16 lb (nitrogen constraint)
4x1 + 3x2 24 lb (phosphate constraint)
x1, x2 0 (non-negativity constraint)
GRAPHICAL REPRESENTATION OF
CONSTRAINTS:
FERTILIZER MIX EXAMPLE (3 of 7)
subject to constraints:
5A + 10B - s1 = 90 (protein constraint)
4A + 3B - s2 = 48 (vitamin constraint)
½A - s3 = 1½ (iron constraint)
A, B, s1,s2 s3 0 (nonnegativity)
GRAPHICAL REPRESENTATION OF
CONSTRAINTS:
HMCR EXAMPLE (6 of 10)
Drawing ½A 1½
Constraints:
4A + 3B 48
5A + 10B 90
Nonnegativity Constraint
A 0, B 0
GRAPHICAL SOLUTION METHOD-ISOCOST
LINE METHOD: HMCR EXAMPLE (7 of 10)
One can start by drawing a 54-cent cost
line : 2A + 3B. = 54
ISOCOST LINE METHOD:
HMCR EXAMPLE (8 of 10)
• Solving for corner point 2 with two equations produces values 8.4 for
A and 4.8 for B, minimum optimal cost solution is:
2A + 3B = (2)(8.4) + (3)(4.8) = 31.2
CORNER POINT SOLUTION
METHOD:HMCR EXAMPLE (10 of 10)
Point 1 - coordinates (A = 3, B =
12)
– cost of 2(3) + 3(12) = 42 cents.
Point 2 - coordinates (A = 8.4, b =
4.8)
– cost of 2(8.4) + 3(4.8) = 31.2
cents
Point 3 - coordinates (A = 18, B =
0)
– cost of (2)(18) + (3)(0) = 36
cents.
4 Feasible Region
2
Vitamin “A” constraint
2 4 5
SUMMARY OF THE OPTIMAL
SOLUTION: NAVY SEA RATIONS
EXAMPLE (4 of 4)
Maximize Profit
= 2X + 3Y
subject to:
X + Y 20
2X + Y 30
X 25
X, Y 0
Infeasibility: A condition that arises when an LP
problem has no solution that satisfies all of its
constraints.
X + 2Y 6
2X + Y 8
X 7
Unboundedness: Sometimes an LP model will not
have a finite solution
Maximize profit
= $3X + $5Y
subject to:
X 5
Y 10
X + 2Y 10
X, Y 0
MULTIPLE OPTIMAL SOLUTIONS
An LP problem may have more than one optimal
solution.
Maximize profit =
$3x + $2y
Subject to:
6X + 4Y 24
X 3
X, Y 0
EXAMPLE: MULTIPLE OPTIMAL
SOLUTIONS
Target Cell
LP EXCEL AND SOLVER PARTS
Constraints
1 3 2
ENTERING INFORMATION IN SOLVER
Invoke Solver by clicking Tools|Solver
Specify Target Cell (D6)
Specify Changing Cells (highlight B5, C5)
Flair Furniture
T C
Tables Chairs
Constraints:
Solver Results
window also
indicates the
availability of
three reports –
- Answer.
- Sensitivity.
- Limits.
SOLUTION
Optimal solution indicated that one should make 30 Tables
and 40 chairs with an optimal profit of $ 410.
Flair Furniture
T C
Tables Chairs
Constraints: