Scribd
Upload
42 views5 pages

Graphical Method

This document presents a linear programming problem to maximize profit for transporting boxes from two corporations. The decision variables are the number of boxes from each corporation. The objective is to maximize total profit, which is a linear function of the boxes. There are two linear constraints on the number of boxes. The optimal solution is found using a graphical method to be 400 boxes from the first corporation and 1,600 from the second, yielding a maximum profit of $1,100.

Uploaded by

Krissel Congson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
42 views5 pages

Graphical Method

This document presents a linear programming problem to maximize profit for transporting boxes from two corporations. The decision variables are the number of boxes from each corporation. The objective is to maximize total profit, which is a linear function of the boxes. There are two linear constraints on the number of boxes. The optimal solution is found using a graphical method to be 400 boxes from the first corporation and 1,600 from the second, yielding a maximum profit of $1,100.

Uploaded by

Krissel Congson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

NAME: KRISSEL CONGSON

SECTION: ACCY1B

Presentation of decision variables


 Let x equal the number of boxes for corporation A and let Y equal the
number of boxes for corporation B

Formulation of objective function (maximize)


 Z= 0.75x + 0.5y

Linear constraints
3x + 5y < 9,200
2x + y < 2,400
X>0
y>0

Identify the method to use


 Graphical method
Plotting of linear constraints in the graph

Inequalities Corresponding x y
Equations When y = 0, x = ? When x = 0, y = ?

3x + 5y < 9,200 3x + 5y = 9,200 (3066.667, 0) (0, 1840)


2x + y < 2,400 2x + y = 2,400 (1200,0) (0, 2400)

3000

2500
(0,2400)

2000

1500

1000

500

0
0 500 1000 1500 2000 2500 3000 3500
Identify the feasible region

3000

2500

2000

1500

1000

500

0
0 500 1000 1500 2000 2500 3000 3500
Optimal solution
Objective function Z= 0.75x + 0.5y
 Possible Solutions
Corner Points Corresponding Values of “Z”

(0,1840) 0.75(0) + 0.5(1,840) = 920

(400,1600) 0.75(400) + 0.5(1,600) = 1,100

(1200,0) 0.75(1,200) + 0.5(0) = 900

Optimal Solution x = 400 and y = 1,600


Value of “Z” maximum at point (400, 1600)

Constraints
x y 3x + 5y < 9,200
0 1,840 9,200 < 9,200
400 1,600 9,200 < 9,200
1,200 0 3,600 < 9,200

x y 2x + y < 2,400
0 1,840 1,840 < 2,400
400 1,600 2,400 < 2,400
1,200 0 2,400 < 2,400

Recommendation
 Therefore, The freight company should transport 400 boxes from corporation
A and 1,600 from corporation B in a haul so that they will generate a
maximum profit of 1,100.

You might also like