37 (COM 2) 2.3 2017 Operations Research and Computer in Business
37 (COM 2) 2.3 2017 Operations Research and Computer in Business
37 (COM 2) 2.3
-
2017
Paper : 2.3
Full Marks : 80
GROUP A-
(Operations Research)
Contd.
lb) Choose the correct alternative :
In LPPs, constraints may represent
(i) limitations
(ii) requirements
(iv) n
37 (COM-2) 2.3/0 2
(e) "A linear programming problem cannot
have more than one optimal solution."
(State True or False)
37 (COM-2) 2.3/0 3 Contd.
(b) Solve the following LPP by Simplex
method : 9
Maximize Z =4x1 +3x2
subject to the constraints :
xl + x2 < 50
xl + 2x2 < 80
Or
3x1 + x2 = 3
4x1 + 3x2 a.6
x1 + 2x2
x1 , x2
37 (COM-2) 2-3/G 4
Or
Find the initial basic feasible solution
to the following transportation problem
by using Vogel's Approximation Method
(VAM) :
Destination Supply
14/1 W2 W3 W4
Fi 21 16 15 3 11
Origin F2 17 18 14 23 13
F3 32 27 18 41 19
Demand 6 10 12 15
-1 _2 8
7 5 -1
6 0 12
GROUP-B
(Computer in Business)
37 (COM-2) 2.3/G
Or
Write a note on 'output design' and the
related devices.
37 (COM-2) 23/G 7 6600