Scribd
Upload
12 views

Assignment 47474NO

The document discusses solving a linear programming problem with two variables and three constraints to find the optimal point that maximizes an objective function. It provides the constraints, finds the feasible region by setting constraints equal to bounds, and calculates the objective function at three points to determine the optimal point is (12,0) with a maximum value of 48.

Uploaded by

Ehab Kilani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
12 views

Assignment 47474NO

The document discusses solving a linear programming problem with two variables and three constraints to find the optimal point that maximizes an objective function. It provides the constraints, finds the feasible region by setting constraints equal to bounds, and calculates the objective function at three points to determine the optimal point is (12,0) with a maximum value of 48.

Uploaded by

Ehab Kilani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment NO.

1
MAXZ = 4X +2X2
1

S.t
2x1 + 4x2 ≤ 40
5x1 + 6x2 ≤ 60
X1 , x2 ≥0

1. 2x1 + 4x2 = 40
X1 = 0 0+4x2 =40 x2=10 (0,10)
x2=0 2x1+0 =40
x1 = 20 (20,0)

5X1 + 6X2 =60


X2=0 5X1+0=60
X1 =0 0+6X2 =60 X1=12 (12,0)
X2 =10 (0,10)
2.
X1
12

10

6
X1

0
0 5 10 15 20 25

3. Point (1) (0,0)


Maxz =4(0) + 2(0) =0

Point (2) (0,10)


MAXz 4(0)+ 2(10) = 20

Point (3) (12,0)


MAXz = 4(12) + 2(0) = 48
Optinal point

You might also like