(6

Institute of Mathenatics and Applications

Andharua, Bhubaneswar
Mid Senester ExAmination -2024
(600 t 00
BSc(Hons) in Mathematics & Computing

Optimization and LPP, Code: DSE-II

Semester-V

Full Mark: 20 Time: 1.5 hours

Answer any Two questions out of the following. Each question carries equal mark.
A company makes two kinds of lcather belts. Leather belt A is of high quality, while belt
Bis of lower quality. The respective profits arc Rs-4 and Rs-3 per belt. Each belt of type
A requires twice £s nuch tinc to produce as a belt of type B. The company can produce a
maximum of 1000 elts per day. The supply of leather is sufficient for only 800 belts per day.
Belt A requires fany buekles and only 400 fancy buckles are available per day, whereas belt
B can use up to 700 buckles per day. Formulate a LPP to maximize the proßt and solve it
using the graphical method.

2Define feasible solution and basic solution. Obtain all the basic solutions to the folowing
system of linear equation:

2.z1 -T + 503 =5
Determine if any of the basic solutious are degenerate. If so, identify the degenerate
solutions. If not, explain why no solutions are degenerate.
How many constraints can there be in a Linear Programming Problem (LPP)?
Use simplex method to solve the LPP: 24 4 3 B
Marimizez = 5T1 + 3T2 2
12
subject to the constraints:
I1 <4,

T2 <3,

T| + 2c2 < 18,

2) + 2 < 9.
tS. 2

C1,2,asta >0
2
 V-S-B.Sc. (H)-(Math. &Computing)
DSE -I -(Optimization & LPP)-(R& B)

2024
FullMarks -70
Time -As in the Programme
Answer any FIVE questions out of the following.
Each question caries equal mark.

Name anddescribe the three main components of

a linear programming problem. (3
(bY Provide an example of a linear programming
problem and explain howW constraints affect the
solution. [3
e) A
company has two grades of inspectors (Grade 1
and Grade 2)who are to be assigned to a quality
inspection work. It is. required that at least 1800
pieces are inspected per 8-hour day. Grade 1
inspectors can check pieces at the rate of 25 per
hour with an accuracy of 98%. Grade 2 inspectors
can check at the rate of 15 pieces per hour with an
accuracy of 95%. The wage rate for Grade 1
inspectors is Rs. 40 per hour, while that of Grade2
inspectors is Rs. 30 pers hour. Each time an error
is caused by the inspector, the co_t to the company
is Rs. 20. The company has 8 Grade 1 and 10
Grade 2 inspectors. The company wants to
[Cont...
S =(S
3 4 : 5

5x+39=45
 |2|
determine the optimal assignment of inspectors to
minimize the total inspection cost. Formuiaie thie
as a Linear Programming Problem (LPP) and
solve using the graphical method. [8
2.(a) PrOve that if a L.P.P has a feasible solution, then it
also has a basic feasible soiution. 7
b) Use the two-phase Simplex method to soBve the
following problem:
Maximize Z =5x, -4x, +3x,
Subject to: 2x, +x, -6x, = 20
6x, +5x, +10x, s 76
8x, -3x, +6x, s $0.
3.(a) State and prove Complementary Siackness
Theorem.
b Use duality to solve the foliowing LPP:
Maximize Z =9x, +7x,
Subject to the constraints: x, + 2x, s7, [9
A-, S4,
(o

SAla) Obtain an initial basic feasible

solution to the
following transportation problem using the north
west corner rule:
[5
[ Con...
2

-6
 |31
D E F G Available
A 11 13 17 14 250
16 18 i4 10 300
C 21 24 13 10 400
Requirement 200 225 275 250
(6) Amanufacturing company has four zones A,
B, C,
Dand four sales engineers P,Q, R, S respectively
for assignment. Since the zones are not
equally
rich in sales potential, it is estimated that a
particular engineer operating in a particular zone
will bring the folowing sales :
Zone A:4,20,000, Zone B:3,36,000, Zone C:
2.94,000, Zone D:4,62,000
The engineers are having different sales ability.
Working under the same conditions their yearly
sales are proportional to 14, 9, 11 and 8
respectively. The criteria of maximum expected
totai sales is to be met by assigning the best
engineer to the richest zone, the next best to the
second richest zone and so on. Find the optimum
assignment and the maximumsales. [7
e) State the difference betwen transporation and
assignment problems. [2
5.(a) Why does the Vogels Approximation Method of
yield a better starting soBution for transportation
problems than the North-West Corner Rule ? 2
2 2

[Cont...
2
26
 |4]
(b) Consider the following transportation problem :(12
Factory Warehouse |Stock available
W, W, W, W,
19 30 S0 10 7
(12
40 30 40 60
40 8 70 20 18
Demand 5 8 7 14
34
Determine:
Anitial Solution by Vogul's Approximation Method.
(Y lsitan optimal solution to the transportation problem?
If not, modify it to obtain a better feasible solution.
6.(a) Use Kuhn-Tucker conditions to solve the following
non-linear programming problems:
Maximize Z= 2x -7%-16x, +2x, +12x;*, +7
Subject to : 2x +Sx, s105, x, x, z0.
(b) Solve f()=x- +2; +2x, +*
starting from the point (0,0). [7
7.(a) Prove that dual of the dual is primal. [4
(b) Explain the use of artifical variables in LPP. [2
(c) State two key difference between linear and non
linear programming. [2
(d) Using the method of Lagrange's multiplier solve the
following NLPP
Minimize Z= 6x +5
Subject to, x, +5x,=7, , x, >0. [6

VS-B.Ss. (H-(Math. &Computing)-DsEJ-(QDimization &LPP-(R& 9)