Escolar Documentos
Profissional Documentos
Cultura Documentos
LINEAR PROGRAMMING
Optimization Problems
Primarily concerned with either allocation of
limited resources in best possible manner;
Determining the level at which some activity
must be performed so that it is best for the
organization; and so on
A train sells for $21 and uses $9 worth of raw materials. Each train built
increases Gias variable labour and overhead costs by $10.
Each week Gia can obtain all the needed raw material but only 100
finishing hours and 80 carpentry hours. Demand for trains is unlimited,
but at most 40 soldiers are bought each week.
If Gia wants to maximize her weekly profit, how many soldiers and trains
should she produce every week?
Product Mix Problem: Summary Data
Soldier Train Available
Selling Price $27 $21
Raw Material Cost $10 $9
Variable Labour and Overhead Cost $14 $10
Objective
To maximize weekly profit
To ensure viability
Number of hours used for manufacturing in finishing
and carpentry department must NOT be more than the
number of hours available
Number of soldiers produced must NOT be more than
the demand
Product Mix Problem: Optimization Model
Decision to be made
Variables
Decision
Number of soldiers to be produced per week
Number of trains to be produced per week
Objective
Objective
Function
To maximize weekly profit
To ensure viability
Number of hours used for manufacturing in finishing
and carpentry department must NOT be more than the
Constraints
number of hours available
Number of soldiers produced must NOT be more than
the demand
Linear Programming Problem (LPP)
Decision Variables
X1: #soldiers to be produced per week
X2: #trains to be produced per week
Constraints
2X1+1X2 <= 100 Finishing Hours Constraint
1X1+1X2 <= 80 Carpentry Hours Constraint
X1 <= 40 Soldiers Demand Constraint
X1 >= 0, X2 >= 0 non-negativity constraints
Solving LPP
Graphical Methods
Applicable for 2-variable problems
Simplex Method
Matrix based
Interior Point Method