Scribd
Upload
18 views4 pages

Assignment - 1: Solution

The document presents a linear programming problem to maximize the objective function Z = 4x1 + x2 + 3x3 + 5x4, subject to 4 constraints. The problem is solved using the simplex method by converting it into standard form and performing row operations to put it in canonical form. The optimal solution is found to be Z = 34, X1 = 1, X2 = 0, X3 = 0, X4 = 6, S1 = 0, S2 = 7, S3 = 0.

Uploaded by

Esrat Sharmin
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
18 views4 pages

Assignment - 1: Solution

The document presents a linear programming problem to maximize the objective function Z = 4x1 + x2 + 3x3 + 5x4, subject to 4 constraints. The problem is solved using the simplex method by converting it into standard form and performing row operations to put it in canonical form. The optimal solution is found to be Z = 34, X1 = 1, X2 = 0, X3 = 0, X4 = 6, S1 = 0, S2 = 7, S3 = 0.

Uploaded by

Esrat Sharmin
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1/ 4

Assignment – 1

We have the following linear programming problem:


Maximize
Z = 4x1 + x2 + 3x3 + 5x4
Subject to the constraints
4x1 – 6x2 – 5x3 – 4x4 ≥ -20
-3x1 – 2x2 + 4x3 + x4 ≤ 10
8x1 – 3x2 + 3x3 + 2x4 ≤ 20
x1, x2, x3, x4 ≥ 0

Solution
The Complete linear Programming problem is-
Maximize, Z = 4x1 + x2 + 3x3 + 5x4
or, Z- 4x1 - x2- 3x3 – 5x4 = 0

Subject to the constrictions


4x1 – 6x2 – 5x3 – 4x4 + s1 = -20
=> – 4x1 + 6x2 + 5x3 + 4x4 – s1 = 20 [Both side Multiplying by -1]
3x1 – 2x2 + 4x3 + x4 ≤ 10
8x1 – 3x2 + 3x3 + 2x4 ≤ 20
x1, x2, x3, x4 ≥ 0
Step:1 – Identifying the decision with adding slag variable
Z- 4x1 - x2- 3x3 – 5x4 = 0

– 4x1 + 6x2 + 5x3 + 4x4 – s1 = 20


– 3x1 – 2x2 + 4x3 + x4+ s2 = 10
8x1 – 3x2 + 3x3 + 2x4 + s3 = 20
Write equation in matrix form
Z x1 x2 x3 x4 s1 s2 s3
1 -4 -1 -3 -5 0 0 0 0
0 -4 6 5 4 1 0 0 20 20/4=5
0 -3 -2 4 1 0 1 0 10 10/1=10
0 8 -3 3 2 0 0 1 20 20/2=10

Step 2: Make the privet element R2 dividing by 2 and the matrix is-
Z x1 x2 x3 x4 s1 s2 s3

1 -4 -1 -3 -5 0 0 0 0
0 -1 1.5 1.25 1 0.25 0 0 5
0 -3 -2 4 1 0 1 0 10
0 8 -3 3 2 0 0 1 20

1st Operation
R1 1 -4 -1 -3 -5 0 0 0 0
Appling R2 × 5 0 -5 7.5 6.25 5 1.25 0 0 25
New R1 1 -9 6.5 3.25 0 1.25 0 0 25

2nd Operation
R3 0 -3 -2 4 1 0 1 0 10
R2 × 1 0 -1 1.5 1.25 1 0.25 0 0 5
New R3 0 -2 3.5 2.75 0 -0.25 1 0 5

3rd Operation
R4 0 8 -3 3 2 0 0 1 20
R2 × 2 0 -2 3 2.5 2 0.50 0 0 10
New R4 0 10 -6 0.5 0 -0.50 0 1 10
Z x1 x2 x3 x4 s1 s2 s3

1 -9 6.5 3.25 0 1.25 0 0 25


0 -1 1.5 1.25 1 0.25 0 0 5
0 -2 -3.5 2.75 0 -0.25 1 0 5
0 -6 -6 0.50 0 -0.50 0 1 10 10/10=1

Step:3
Make the pivot element R4 diving by 10 and the matrix is-
Z x1 x2 x3 x4 s1 s2 s3

1 -3 6.5 3.25 0 1.25 0 0 25


0 -1 1.5 1.25 1 0.25 0 0 5
0 -2 -3.5 2.75 0 -0.25 1 0 5
0 1 -0.6 0.05 0 -0.05 0 0.1 0.1

4th Operation
R1 1 -9 6.5 3.25 0 1.25 0 0 25
R4 × 9 0 9 -5.4 0.45 0 -0.45 0 0.9 9
New R1 (Add) 1 0 1.1 3.7 0 0.80 0 0.9 34

5th Operation
R2 0 -1 1.5 1.25 1 0.25 0 0 5
R4 × 1 0 1 -0.6 0.05 0 0.05 0 0.1 1
New R2 (Add) 0 0 0.9 1.3 1 0.2 0 0.1 6
6th Operation
R3 0 -2 -3.5 2.75 0 -0.25 1 0 5
R4 × 2 0 2 -1.2 0.1 0 -0.1 0 0.2 0.2
New R3 0 0 -4.7 2.85 0 -0.35 1 0.2 7

New Matrix Is-


Z x1 x2 x3 x4 s1 s2 s3

1 0 1.1 3.7 0 0.8 0 0.9 34


0 0 0.9 1.3 1 0.2 0 0.1 6
0 0 -4.7 2.85 0 -0.35 1 0.2 7
0 1 -0.6 0.05 0 -0.05 0 0.1 1

So,
Z = 34
X1 = 1
X2 = 0
X3 = 0
X4 = 6
S1 = 0
S2 = 7
S3 = 0

You might also like