Scribd
Upload
580 views2 pages

Assignment - 2 (Ot)

The document contains 5 questions regarding solving linear programming problems (LPP) using various methods like graphical method, simplex method, and big-M method. It involves maximizing and minimizing objective functions subject to various inequality and equality constraints over variables x1, x2, x3 etc. ranging from 1 to 3 variables. The problems cover a variety of LPP scenarios and their optimal solutions are provided.

Uploaded by

satyam rai
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
580 views2 pages

Assignment - 2 (Ot)

The document contains 5 questions regarding solving linear programming problems (LPP) using various methods like graphical method, simplex method, and big-M method. It involves maximizing and minimizing objective functions subject to various inequality and equality constraints over variables x1, x2, x3 etc. ranging from 1 to 3 variables. The problems cover a variety of LPP scenarios and their optimal solutions are provided.

Uploaded by

satyam rai
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/ 2

MANIPAL UNIVERSITY, JAIPUR

Department of Mathematics
B.Tech.: IV/VI Semester -2019 (Open Elective)

Subject: Optimization Techniques: MA1690

ASSIGNMENT-II

Q1. Solve the following Linear Programming Problem (LPP) by Graphical Method:
a) Maximize Z = 2x1 + x2
Subj. to x1 + 2x2 ≤ 10
x1 + x2 ≤ 6
x1 – x2 ≤ 2
x1 – 2x2 ≤ 1
and x1, x2, ≥ 0 (Ans. x1 =4, x2 = 2, Maz. Z = 10)
b) Maximize Z = 50x1 + 30x2
Subj. to 2x1 + x2 ≥ 18
x1 + x2 ≥ 12
3x1 + 2x2 ≤ 34
and x1, x2, ≥ 0 (Ans. x1 =10, x2 = 2, Maz. Z = 560)
c) Maximize Z = 6x1 - 4x2
Subj. to 2x1 + 4x2 ≤ 4
4x1 + 8x2 ≥ 16
and x1, x2, ≥ 0

d) Maximize Z = 6x1 + x2
Subj. to 2x1 + x2 ≥ 3
x1 - x2 ≤ 0
and x1, x2, ≥ 0
Q2. Solve the following LPP using Graphical Method:
a) Minimize Z = 3x1 + 2x2
Subj. to 5x1 + x2 ≥ 10
x1 + x2 ≥ 6
x1 + 4x2 ≥ 12
and x1, x2 ≥ 0 (Ans. x1 =1, x2 = 5, Min. Z = 13)
b) Minimize Z = 6x1 + 14x2
Subj. to 5x1 + 4x2 ≥ 60
x1 + 2x2 ≥ 18
3x1 + 7x2 ≤ 84
and x1, x2, ≥ 0 (Ans. x1 =18, x2 = 0, Min. Z = 108)
c) Minimize Z = -x1 + 2x2
Subj. to -x1 + 3x2 ≤ 10
x1 + x2 ≤ 6
x1 - x2 ≤ 2
and x1, x2 ≥ 0 (Ans. x1 =2, x2 = 0, Min. Z = -2)
Q3. Solve the following Linear Programming Problem using Simplex Method:
a) Maximize Z = 5x1 + 3x2
Subj. to 3x1 + 5x2 ≤ 15
5x1 + 2x2 ≤ 10
and x1, x2, ≥ 0 (Ans. x1 20/19, x2 = 45/19, Max. Z =235/19)
b) Maximize Z = 6x1 + 8x2
Subj. to 30x1 + 20x2 ≤ 300
5x1 + 10x2 ≤ 110
and x1, x2, ≥ 0 (Ans. x1 =4, x2 = 9, Max. Z = 96)
c) Maximize Z = 3x1 + 5x2 + 4x3
Subj. to 2x1 + 3x2 ≤ 8
2x2 + 5x3 ≤ 10
3x1 + 2x2 + 4x3 ≤ 15
and x1, x2, x3 ≥ 0 (Ans. x1 =89/41, x2 = 50/41, x3 = 62/41, Max. Z = 765/41)
1
Page
d) Maximize Z = 1000x1 + 4000x2 + 5000x3
Subj. to 3x1 + 3x2 ≤ 22
x1+ 2x2 + 3x3 ≤ 14
x1 + 2x2 ≤ 14
and x1, x2, x3 ≥ 0 (Ans. x1 =0, x2 = 7, x3 = 0, Max. Z = 28000)

Q4. Solve the following LPP using big-M method:


a) Maximize Z = -2x1 - x2
Subj. to 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≤ 4
and x1, x2, ≥ 0 (Ans. x1 =3/5, x2 = 6/5, Max. Z = 12/5)

b) Minimize Z = 9x1 + 10x2


Subj. to 2x1 + 4x2 ≥ 50
4x1+ 3x2 ≥ 24
3x1 + 2x2 ≥ 60
and x1, x2 ≥ 0 (Ans. x1 =70/4, x2 = 15/4, x3 = 0, Min. Z = 195)

c) Minimize Z = 4x1 + 3x2 + x3


Subj. to x1 + 2x2 + 4x3 ≥12
3x1 + 2x2 +x3≥ 8
and x1, x2, x3 ≥ 0 (Ans. x1 =0, x2 = 0, x3 = 8, Min. Z = 8)

d) Minimize Z = 5x1 + 3x2


Subj. to x1 + x2 ≤ 50
x1+ 2x2 ≥ 80
3x1 + x2 ≥ 140
and x1, x2 ≥ 0 (Ans. Infeasible solution)

Q5. Solve the given LPP:


a) Max. Z = 4x1 + 3x2
Subj. to x1 + x2 = 5
x1+ 2x2 ≤ 6
5x1 + 2x2 ≥ 10
and x1, x2 ≥ 0 (Ans. x1 =4, x2 = 1, Min. Z = 23)

b) Min. Z = 4x1 + 2x2


Subj. to 3x1 + x2 ≥ 27
x1+ x2 ≥ 21
x1 + 2x2 ≥ 30
and x1, x2 ≥ 0 (Ans. x1 =3, x2 = 18, Min. Z = 48)

c) Min. Z = 8x1 + 4x2 + 2x3


Subj. to 4x1 + 2x2 + x3 ≤ 8
3x1+ 2x3 ≤ 10
x1 + x2 + x3 = 4
and x1, x2, x3 ≥ 0 (Ans. x1 =0, x2 = 0, x3 = 4 Max. Z = 8)
2
Page

You might also like