Objectives
Requirements for a linear programming model. Graphical representation of linear models.
Objectives - continued
Sensitivity analysis concepts:
Reduced costs Range of optimality--LIGHTLY Shadow prices Range of feasibility--LIGHTLY Complementary slackness Added constraints / variables
3.2
Marketing requirement
Total production cannot exceed 800 dozens. Number of dozens of Space Rays cannot exceed number of dozens of Zappers by more than 450.
Technological input
Space Rays require 2 pounds of plastic and 3 minutes of labor per dozen. Zappers require 1 pound of plastic and 4 minutes of labor per dozen.
10
Management is seeking a production schedule that will increase the companys profit.
12
MODEL FORMULATION
Decisions variables:
X1 = Production level of Space Rays (in dozens per week). X2 = Production level of Zappers (in dozens per week).
Objective Function:
Weekly profit, to be maximized
13
14
we have a plastics resource constraint, a production time constraint, and two marketing constraints. PLASTIC: each dozen units of Space Rays requires 2 lbs of plastic; each dozen units of Zapper requires 1 lb of plastic and within any given week, our plastic supplier can provide 1200 lbs.
15
subject to 2X1 + 1X2 < = 1200 (Plastic) 3X1 + 4X2 < = 2400 (Production Time) X1 + X2 < = 800 (Total production) X1 - X2 < = 450 (Mix) Xj> = 0, j = 1,2 (Nonnegativity)
16
a
FEASIBLE REGION
17
X2 1200
The plastic constraint: The Plastic constraint 2X1+X2<=1200 Total production constraint: X1+X2<=800
600
Infeasible
Production mix constraint: X1-X2<=450
600 800 X1
Interior points. Boundary There are three typespoints. of feasible points Extreme points.
19
20
Start at some arbitrary profit, say profit = $2,000... Then increase the profit, if possible... X2
...and continue until it becomes infeasible
800 600
1200
X2
800 600
Infeasible
25
The value of the objective function will change if the coefficient multiplies a variable whose value is nonzero.
26
800 600
Range of optimality
800 600
400
600
800
X1
28
Multiple changes
The range of optimality is valid only when a single
100% rule.
This is beyond the scope of this course
29
Reduced costs
The reduced cost for a variable at its lower bound (usually zero) yields:
The amount the profit coefficient must change before the variable can take on a value above its lower bound.
Complementary slackness
At the optimal solution, either a variable is at its lower bound or the reduced cost is 0.
30
31
32
In sensitivity analysis of right-hand sides of constraints we are interested in the following questions:
Keeping all other factors the same, how much would the optimal value of the objective function (for example, the profit) change if the right-hand side of a constraint changed by one unit? For how many additional UNITS is this per unit change valid? For how many fewer UNITS is this per unit change valid?
33
X2 1200
34
Included costs: The shadow price is the premium value above the existing unit value for the resource, since the cost of the resource is included in the calculation of the objective function coefficient. 35
Range of feasibility
The set of right - hand side values for which the same set of constraints determines the optimal extreme point. The range over-which the same variables remain in solution (which is another way of saying that the same extreme point is the optimal extreme point) Within the range of feasibility, shadow prices remain
Addition of a variable.
Deletion of a variable. Changes in the left - hand side technology coefficients.
37
Infeasibility
No point, simultaneously, lies both above line 1 and below lines 2 2 and 3 .
1
39
Unbounded solution
40
41
Decision variables
X1 (X2) -- The number of two-ounce portions of Texfoods (Calration) product used in a serving.
The Model
Cost per 2 oz. Minimize 0.60X1 + 0.50X2 Subject to 20X1 + 50X2 100 Vitamin A % Vitamin A 25X1 + 25X2 100 Vitamin D provided per 2 oz. 50X1 + 10X2 100 Iron X1, X2 0
% required
42
Feasible Region
Vitamin D constraint
2 Vitamin A constraint
43
44
3.12 Computer Solution of Linear Programs With Any Number of Decision Variables
Linear programming software packages solve large linear models. Most of the software packages use the algebraic technique called the Simplex algorithm. The input to any package includes:
The objective function criterion (Max or Min). The type of each constraint: , , . The actual coefficients for the problem.
45
47
An iteration
One non-basic variable enters the basis and becomes a basic variable One basis variable exits the basis and becomes non-basic The basis variables re-solved in terms of the non-basis variables The non-basis variables are fixed, usually at their lower bounds, which is zero, usually
49
52