Linear Programming Approach
Linear Programming Approach
Chapter 2
We will check that point C, gives the optimum (Best) solution i.e.
max. Z value i.e., we put x1 = 3 & x2 = 1.5 in equation (*), we get Z =
21 i.e. Z = 21 X 1000 => Z = $21,000.
Resource Requirements
Product LABOR CLAY PROFIT
(hr./unit) (lb./unit) ($/unit)
Bowl 1 4 40
Mug 2 3 50
For how many days each plant be run for the next
quarter so as to minimize the production cost,
while still meeting the market demand?
Practice Exercise 1:
Q#1: A company produces two products that are processed on two assembly
lines. Assembly line 1 has 100 available hours, and assembly line 2 has 42
available hours. Each product requires 10 hours of processing time on line 1,
while on line 2 product 1 requires 7 hours and product 2 requires 3 hours. The
profit for product 1 is $6 per unit, and the profit for product 2 is $4 per unit.