ASSIGNMENT QUESTION(2023-24)EVEN

SUB-OPTIMIZATION IN ENGINEERING(ROE6A001)
BRANCH-ME,EE,CSE&ECE

(1) Solve the given linear programming problem using graphical method.
Maximize Z=3x1+4x2
Subject to 4x1+2x2≤80
2x1+5x2 ≤180
x1≥0,x2≥0

(2) Solve the given linear programming problem using simplex method. Maximize Z=x1+2x2
Subject to -x1+2x2≤8
x1+2x2≤12
x1- 2x2 ≤ 3
x1≥0,x2≥0
(3) Use dual simplex method to solve the following linear programming problem.
Maximize Z=-3x1-x2
Subject to x1+x2 ≥1
2x1+3x2 ≥2
x1≥0,x2≥0
(4) Use revised simplex method to solve the following LPP.
Maximize Z=6x1-2x2+3x3
Subject to 2x1-x2+2x3≤2
x1+4x3≤4
x1≥0,x2≥0
(5) Find the optimal solution by MODI method:
D1 D2 D3 D4 Supply
S1 21 16 25 13 11
S2 17 18 14 23 13
S3 32 17 18 41 19
Demand 6 10 12 15 43
(6) A company has 4 machines to do 3 jobs .Each job can be assigned to only one machine.The
cost of each job on each machine is given below.Determine the job assignment that will minimize the
total cost.
Machine
1 A B C D

[ ]
18 24 28 32
8 13 17 18
Job 2
10 15 19 22
3

(7) Solve the following Non-linear programming problem

Maximize f=-x12-x22-x32+4x1+6x2
Subject to x1+x2≤2
2x1+3x2≤12
x1,x2≥0

(8) Arrival s at a telephone booth are considered to be Poisson , with an average time of 10
minutes between one arrival and the next.The length of a phone call is assume to be
distributed exponential,with mean 3 minutes.Estimate the fraction of the day that the
phone will be in use.