Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
77 views

Linear Programming Exercises

The document contains examples and exercises on linear programming. Exercise 1.1 provides two problems involving maximizing profit based on constraints on acreage of crops. Exercise 1.2 involves maximizing revenue from two juice products based on ingredient constraints. Exercise 1.3 involves maximizing profit from paper production based on constraints of available wood and marketing policies.

Uploaded by

Ashley Balba
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
77 views

Linear Programming Exercises

The document contains examples and exercises on linear programming. Exercise 1.1 provides two problems involving maximizing profit based on constraints on acreage of crops. Exercise 1.2 involves maximizing revenue from two juice products based on ingredient constraints. Exercise 1.3 involves maximizing profit from paper production based on constraints of available wood and marketing policies.

Uploaded by

Ashley Balba
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 23

Linear Programming

• Exercise 1.1
•Exercise 1.2
Exercise 1.1
Problem No. 1
Let x1  acres of corn Z  5000 x1  4000 x2
x2  acres of corn Subjected to :
Z  profit (1) x1  x2  10
(2) x1  x2  7
(3) 8500 x1  6500 x2  85000
(4) 2.25 x1  1.5 x2  16
x1 , x2  0
y
10

4
2 points
3

-3 -2 -1 O 1 2 3 4 5 6 7 8 9 10 11
B
Exercise 1.1 No.1
C C : L1  L 4
 L1 x1  x2  10
A  L 4 2.25 x1  1.5 x2  16

2.2510  x2   1.5 x2  16
A(0, 7) D
E  0.75 x2  6.5
B 0,10 
2
C  ? x2  8.66  8
3
 1   1 2
D 7 , 0  C 1 , 8 
 9   3 3
E  7,0 
Exercise 1.1 No.1
A(0, 7)
Z  5000 x1  4000 x2
B 0,10 
 1 2
A : Z  5000 0   4000  7   28000
C 1 , 8 
 3 3 B : Z  5000 0  4000 10  40000
 1   1  2
D 7 , 0  C : Z  50001   4000  8   41333.33
 9 
 3  3
E  7,0 
 1
D : Z  5000 7   4000  0  35555.55
 9
E : Z  5000 7   4000  0  35000
Exercise 1.1 No.2
Let x1  cases of T .Juice
x2  cases of T .Paste
Z  revenue
Z  1500 x1  1000 x2
Subjected to :
(1) 24 x1  12 x2  100,000
( 2) x1  2500
(3) x2  4000
x1 , x2  0
7

7000 A(0, 0)
6000 B (0, 4000)
5000
B C C (2166.67, 4000)
4000 D
3000
D(2500, 3333.33)
2000 E 2500,0
1000
A E
O x
-1000
-2000
-3000
A(0, 0) ; B(0, 4000); C (2166.67, 4000); D(2500, 3333.33); E 2500,0

Z  1500 x1  1000 x2
A: Z  0
B : Z  1500 0  1000 4000  4,000,000
C : Z  1500 2166.67   1000 4000  7,250,005
D : Z  1500 2500  1000 3333.33  7,083,330
E : Z  1500 2500  1000 0  3,750,000
Exercise 1.2 No.1
Mild Extra Total Cost of Packaging Total Selling
Cheddar Sharp Ingredients Cost Cost Price
(lb/cont) (lb/cont)
cost/lb 60 80
Regular 6 1.5 480 10 490 1000
Zesty 4.5 3 510 10 520 1200
Availabl 8100 3000
e

1 lb = 16oz 120 per container = 7.5lb


Exercise 1.2 No.1
Let: x1 be the container of Regular Blend
x2 be the container of Zesty Blend
Z be the maximum to total profit

Maximize Z = 510x1 + 680x2


(1) Avail. Supply of Mild Cheddar
6x1+ 4.5x2 < 8100
(2) Avail Supply of Extra Sharp Cheddar
1.5x1 + 3x2 < 3000
non-negativity: x1, x2 > 0
Exercise 1.2 No.1
(1) 6x1+ 4.5x2 = 8100
x1= 0; x2 = 1800
x1= 1350; x2 = 0
(2) 1.5x1 + 3x2 = 3000
x1= 0; x2 = 1000
x1= 2000; x2 = 0
Exercise 1.2 No.1
(0,1800)

(0,1000)

O (1350,0) (2000,0) x
Exercise 1.2 No.1
(0,1800)

B(0,1000)
C

O
A(0,0) D(1350,0) (2000,0) x
Exercise 1.2 No.2
Machine Labor Cost per Selling Price Profit per
Time Time Brand per Brand Brand

Brand A 5 25 325 645 320

Brand B 4 30 350 700 350


Brand C 6 60 425 900 475
Let: x1 be the units of Brand A
x2 be the units of Brand B
x3 be the units of Brand C
Z be the maximum to total profit
Exercise 1.2 No.2
Maximize Profit (Z) :
Z = 320x1 + 350x2 + 475x3

Constraints:
1. Available Machine Time
2. Available Labor Time
3. Available Budget
Exercise 1.2 No.2
The company works on a weekly schedule of 5 days, with two shifts of
7.5 hours (net time). It has 11 machines available for production and
71 employees on each shift

Avail. Machine Time = (no. of machines)(working time)

working time = (5 days/week)(2 shifts/day)(7.5hrs/shift)(60mins/hr)


working time = 4,500 mins/week
Avail. Machine Time = (11 machines)(4,500 mins/week)
Avail. Machine Time = 49,500 mins/week
Exercise 1.2 No.2
The company works on a weekly schedule of 5 days, with two shifts of
7.5 hours (net time). It has 11 machines available for production and
71 employees on each shift

working time = 4,500 mins/week

Avail. Labor Time = (no. of workers)(working time)

Avail. Labor Time = (71 workers)(4,500 mins/week)

Avail. Labor Time = 319,500 mins/week


Exercise 1.2 No.2
Constraints:
1. Available Machine Time
5x1 + 4x2 + 6x3 < 49,500
2. Available Labor Time
25x1 + 30x2 + 60x3 < 319,500
3. Available Budget
325x1 + 350x2 + 425x3 < 2,000,000
Exercise 1.3 No. 1
Spruce Fir Selling Price Total Cost Profit
per Ton per Ton per Ton
cost/ton 1000 1150
Paper for Books 2 3 30000 5450 24550
Paper for Magazines 2 2 27000 4300 22700

Let: x1 be the tons of paper for Books


x2 be the tons of paper for magazines
Z be the maximum to total profit
Maximize Z = 24550x1 + 22700x2
Exercise 1.3 No. 1
Constraints:
1. Available Spruce 5. Marketing Dep’t. Policy
2x1 + 2x2 < 300,000 x2 > 1.5x1
2. Available Fir
3x1 + 2x2 < 350,000
3. Required Qty of Books
x1 > 25,000
4. Required Qty of Books
x2 > 100,000
y

(0,150000) 2x1 + 2x2 < 300,000


3x1 + 2x2 < 350,000
x1 > 25,000
x2 > 100,000
(0,100000)
x2 > 1.5x1

(2,3)

O (25000,0) (116666.67,0) (150000,0) x


y

(0,150000) 2x1 + 2x2 < 300,000


3x1 + 2x2 < 350,000
x1 > 25,000
x2 > 100,000
(0,100000)
x2 > 1.5x1

(2,3)

O (25000,0) (116666.67,0) (150000,0) x


y

B 2x1 + 2x2 < 300,000


3x1 + 2x2 < 350,000
x1 > 25,000
x2 > 100,000
x2 > 1.5x1

A C
0,100000)

You might also like