Total No. of Questions : 5] SEAT No.

8
23
P3347 [Total No. of Pages : 7
[6027]-25

ic-
tat
F.Y.M.C.A. (Management)

4s
MT - 21 : OPTIMIZATION TECHNIQUES

4:5
(2020 Pattern) (Semester - II)

02 71
0:3
Time : 2½ Hours] [Max. Marks : 50

1
Instructions to the candidates:

31
8/0 013
1) All questions are compulsory.
2) Use of statastical table and non programmable calculator is allowed.
7/2
3) Figures to the right indicate full marks.
.23 MP

Q1) Attempt the following MCQs (0.5 marks each). [10]

8.2 IM

82

8
a) In the LPP set of basic variables which are appeared in linear problem

23
consist of

ic-
16

i) Slack & real variables ii) Slack & artificial variables

tat
4s
iii) Departing basic variables iv) Departing non basic variables
.24

4:5
1
49

b) Objective of sequencing problem is to find possible _______which

0:3
17

minimize total elapsed time

31
13

i) Sequence ii) Ratio

02
P0

iii) Solution iv) Order

7/2
M
8/0

c) Floats for critical activities will be always_______.

IM
82

8
i) Zero ii) One

23
.23

iii) Smallest iv) Largest

ic-
16

tat
8.2

d) Type of decision making environment is

4s
.24

i) Risk ii) Certainty

4:5
71

iii) Uncertainty iv) All of these

49

0:3
31
31

e) A game is said to be fair if

1
02
P0

i) both upper and lower values of the game are same & zero
7/2

ii) Upper & lower values of game are not equal

M
8/0

iii) Upper value is more than lower value of game

IM
82

iv) None of these

.23
16

f) The determine (s) the equilibrium of Markov process_______.

8.2

i) Original state probabilities ii) State vector

.24

iii) Transition matrix iv) Fundamental matrix

P.T.O.
49
 g) LPP involving more than two variables can be solved by

8
23
i) Simplex method ii) Graphical method

ic-
iii) Matrix minima method iv) Hungerian method

tat
4s
h) Time during which machine remains waiting or vacant in sequencing

4:5
problem is called_______ time.

02 71
0:3
i) Processing ii) Waiting

1
31
iii) Idle 8/0 013 iv) Free
7/2
i) Full form of CPM is________.
.23 MP

i) Critical path method ii) Control path method

8.2 IM

82

iii) Critical plan management iv) Control path management

8
23
ic-
j) Which of the following criterion is not used for decision making under
16

tat
uncertainty

4s
i) Maximin ii) Minimax
.24

4:5
1
iii) Maximax iv) Minimize expected loss
49

0:3
17
31
13

k) A mixed strategy game can be solved by

02

i) algebraic method ii) graphical method

P0
7/2

iii) matrix method iv) all of these

M
8/0
IM
82

8
l) Assigning random numbers in Monte carlo simulation it is important

23
.23

to______.
ic-
16

i) Develop cumulative probability distribution

tat
8.2

4s

ii) Use random numbers from random number table

.24

4:5

iii) Use only single set of random numbers

71
49

iv) Use excel spreadsheets

0:3
31
31
1

m) In simplex method feasible basic solution must satisfied.

02
P0

i) Non negativity constraint ii) Negativity constraint

7/2
M

iii) Basic constraint iv) Common constraint

8/0
IM
82

n) Total time required to complete all the jobs in a job sequencing problem
.23

is known
16

i) elapsed time ii) idle time

8.2

iii) processing time iv) processing order

.24

[6027]-25 2
49
 o) Shortest possible time in which an activity can be achieved under ideal

8
circumstances is known as_______.

23
i) Pessimistic time estimate ii) Optimistic time estimate

ic-
iii) Expected time estimate iv) Most likely time estimate

tat
4s
p) The difference between expected profit under conditions of risk and ex-

4:5
pected profit with perfect information is called________.

02 71
0:3
i) EvPI ii) EMI

1
iii) EV iv) None of these

31
8/0 013
q) Game theory models are classified by the
7/2
.23 MP

i) no. of players ii) sum of payoff

iii) no. of strategies iv) all of these
8.2 IM

82

8
r) The condition that system can be in only one state at any point in time is

23
known as

ic-
16

i) Transient state ii) Absorbent condition

tat
iii) Mutually exclusive condition iv) Collectively exhaustive condition

4s
.24

4:5
s) Objective function of linear programming problem is
1
49

0:3
17
i) Constraint ii) Function to be optimized
iii) Relation between variables iv) None of these
31
13
02

t) Full form of PERT is

P0
7/2

i) Program evaluation & Rate technology

M

ii) Program evaluation & Robot technique

8/0

iii) Project evaluation & robot technology

IM
82

8
23
iv) Program evaluation & review technique.
.23

ic-
16

Q2) a) Solve following LPP [6]

tat
8.2

4s

Maximize z = 50 x1 + 100 x2
.24

4:5

Subject to constraints
71
49

x1 + x2 < 150
0:3
31

2x1 + 3 x2 < 360

31
1

x1, x2 > 0
02
P0

b) Find the saddle point and determine the optimal strategies for the game[4]
7/2
M
8/0

B1 B2 B3 B
IM
82

A1  4 0 2 
A A 2  6 −1 4 
.23

 
16

A 3 8 −5 −3
8.2

OR
.24

[6027]-25 3
49
 a) Solve following LPP. [6]

8
Maximize z = 7 x1 + 6 x2

23
Subject to constraints

ic-
x1 + x2 < 4

tat
2x1 + x2 < 6

4s
x1, x2 > 0

4:5
02 71
0:3
b) Solve the following game [4]

1
31
8/0 013 Player B
Player A B1
7/2 B2
A1 3 5
.23 MP

A2 4 1
8.2 IM

82

8
23
Q3) a) Small project consist 7 activities whose time estimates are as follows[6]

ic-
Activity Estimated Duration (weeks)
16

tat
(i-j) Optimistic Most likely Pessimistic

4s
(1-2) 1 1 7
.24

(1-3) 1 4 7
4:5
1
(1-4) 2 2 8
49

0:3
17

(2-5) 1 1 1
31
13

(3-5) 2 5 14
02

(4-6) 2 5 8
P0
7/2

(5-6) 3 6 15
M
8/0

Determine:
i) Draw network diagram & identify critical path.
IM
82

8
23
ii) Identify critical activities & duration of project.
.23

iii) Determine probability of completing project in 13 weeks.

ic-
16

tat
8.2

4s

b) In a toy manufacturing company suppose product acceptance

.24

4:5

probability are not known but following data known. [6]

71

Anticipated 1 year profit (Rs. ‘000’)

st
49

0:3
31

Acceptance
31

Product Full Partial Minimal

1
02

Good 8 70 50
P0
7/2

Fair 50 45 40
M
8/0

Poor –25 –10 0

Determine optimal decision under
IM
82

i) Maximax
.23

ii) Maximin
16

iii) Minimax regret criteria

8.2

OR
.24

[6027]-25 4
49
Q3) a) The time & cost estimates of different activities are as given below. [6]

8
23
Activity Time(weeks) Cost (Rs.)

ic-
(i-j) Normal CRash Normal Crash

tat
4s
(1-2) 3 2 300 400

4:5
02 71
(2-3) 3 3 30 30

0:3
1
(2-4) 7 5 420 580

31
8/0 013
(2-5) 9
7/2 7 720 810
.23 MP

(3-5) 5 4 250 300

(4-5) 0 0 0 0
8.2 IM

82

8
23
(5-6) 6 4 320 410

ic-
16

(6-7) 4 3 400 470

tat
4s
(6-8) 13 10 780 900
.24

4:5
1
(7-8) 10 9 1000 1200
49

0:3
17

Indirect cost is Rs. 50 per weeks.

31
13
02

i) Draw the net work & identify critical path.

P0
7/2

ii) Crash relevant activities systematically & find optimal project dura-
M
8/0

tion & cost.

IM
82

8
23
.23

b) A major consumer goods manufacturer wishes to decide new product ic-

16

tat
bring out in the market which of the profit table is as follows (Profit per in
8.2

4s

units of Rs. 10000). [6]

.24

4:5
71

Strategies States
49

0:3
31

S1(0.4) S2(0.5) S3(0.1)

31

A1 140 100 80
1
02
P0
7/2

A2 160 130 120

M
8/0

A3 200 160 140

IM
82

Determine:-
.23

i) Expected monetary value (EMV).

16

ii) Expected monetary value with-perfect information (EMVPI).

8.2

iii) Value of perfect information.

.24

[6027]-25 5
49
Q4) a) Seven jobs are to be processed through 2 machines A & B processing

8
time (in hrs) are as follows. [6]

23
Jobs 1 2 3 4 5 6 7

ic-
Machine-A 10 9 7 15 18 20 14

tat
Machine-B 12 8 7 12 10 6 13

4s
Determine:

4:5
02 71
i) Sequence of jobs.

0:3
ii) Idle time for machine A & B.

1
31
8/0 013
b) A market survey is made on 3 brands of breakfast foods x, y, z. Every
7/2
.23 MP

time customer purchases new package following estimates for shift

(in percent) are obtained. [4]
Next
8.2 IM

82

8
23
Present X Y Z

ic-
X 70 20 10
16

tat
Y 30 50 20

4s
Z 30 30 40
.24

4:5
It is estimated that 30% people buy brand x, 20% buy brand y & 50%
1
49

buy brand z. What will be the distribution of the customers for first and
0:3
17

second period.
31
13

OR
02
P0

a) 5 Jobs are to be processed through 3 machines processing time (in hrs)

7/2

are as follows. [6]

M
8/0

Determine:
IM
82

i) Sequence of jobs.

8
23
ii) Elapsed time for machine A, B & C.
.23

Jobs 1 2 3 4 5 ic-
16

tat
Machine-A 10 11 8 7 6
8.2

4s

Machine-B 6 4 5 3 2
.24

4:5

Machine-C 9 5 4 6 8
71
49

0:3
31
31

b) Market share of brands A, B & C are 50%, 30% & 20% customers shift
1

their brands in matrix as below. [4]

02
P0

From To
7/2

A B C
M
8/0

A 50% 30% 20%

IM
82

B 20% 70% 10%

.23

C 20% 20% 60%

16

Find:
8.2

i) Transition matrix for brands.

.24

ii) Find share at the end of period 1 & 2.

[6027]-25 6
49
Q5) a) Distribution of demand for books has been found following information.

8
23
[4]

ic-
Demand 15 16 17 18 19 20 21 22

tat
4s
No. of Copies 0.05 0.08 0.20 0.45 0.10 0.07 0.03 0.02

4:5
02 71
0:3
Generate demand for 20 times period using following random numbers,

1
31
8/0 013
also calculate average no. of copies demand.
14, 2, 93, 99, 18, 71, 37, 30, 12, 10, 88, 13, 00, 57, 69, 32, 18, 8, 92, 73
7/2
.23 MP

b) Explain the terms. [4]

i) Basic solution.
8.2 IM

82

8
23
ii) Dummy activity.

ic-
16

OR

tat
4s
.24

4:5
1
a) A confectioner sells items past data of demand per week is given below.
49

0:3
17

[4]
31
13

Demand in (kg) 0 5 10 15 20 25
02
P0
7/2

Probability 0.04 0.22 0.16 0.42 0.10 0.06

M
8/0

Generate demand for next 10 weeks & average demand per week using
IM
82

8
random numbers-

23
.23

ic-
78, 99, 43, 62, 44, 2, 67, 32, 54, 75
16

tat
b) Explain the terms: [4]
8.2

4s

i) Degenerate solution.
.24

4:5
71

ii) Float.
49

0:3
31
31

  
1
02
P0
7/2
M
8/0
IM
82
.23
16
8.2
.24

[6027]-25 7
49