0% found this document useful (0 votes)
152 views17 pages

Paper 01

The document appears to be a practice exam for a course on operations research. It contains 38 multiple choice questions testing various concepts in operations research, including: replacement models, transportation problems, assignment problems, queuing models, linear programming, PERT, and simplex algorithm. The questions cover topics such as present worth factors, traffic intensity, expected queue length, EOQ formula, dummy activities in networks, artificial variables, phase I and phase II methods, and minimizing objectives subject to constraints.

Uploaded by

faisal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
152 views17 pages

Paper 01

The document appears to be a practice exam for a course on operations research. It contains 38 multiple choice questions testing various concepts in operations research, including: replacement models, transportation problems, assignment problems, queuing models, linear programming, PERT, and simplex algorithm. The questions cover topics such as present worth factors, traffic intensity, expected queue length, EOQ formula, dummy activities in networks, artificial variables, phase I and phase II methods, and minimizing objectives subject to constraints.

Uploaded by

faisal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 17

FINALTERM EXAMINATION

Fall 2012
MTH601 - Operations Research

Question No: 2 ( Marks: 1 ) - Please choose one

During a replacement if the value of money decreases at the rate of 3% then the present worth
factor of unit amount to be spent after one year is given by
► 0.25
► 0.333
Selected answer 0.9708
►4

Question No: 3 ( Marks: 1 ) - Please choose one

If the money carries a rate of interest of 12% per year, the present worth factor of one rupee
due in one year is
Selected answer 0.08333
► 0.89285
► 0.0769
► 13

Question No: 4 ( Marks: 1 ) - Please choose one

Search and cutting methods are used to solve following types of problems
► Transportation
► Assignment
Selected answer Integer Programming
► Queuing problems

Question No: 5 ( Marks: 1 ) - Please choose one

A feasible solution is called a _______________ solution if the number of non negative allocation
is equal to “m + n – 1” (Here m is the number of rows, n is the number of columns in transportation
problem)

Selected answer basic feasible


► non basic feasible
► basic infeasible
► optimal

Question No: 10 ( Marks: 1 ) - Please choose one


Transportation problem is a special class of linear programming problem in which transport a
commodity from the source to a destination in such a way that the total transportation cost is
► Zero
► Maximum
Selected answer Minimum
► Average

Question No: 11 ( Marks: 1 ) - Please choose one

We solve a assignment problem by subtracting least number in each row and we get the table
below:

After doing next step, which table should be next?


Selected answer

Question No: 12 ( Marks: 1 ) - Please choose one


The cost matrix in assignment problem is always
Selected answer identity matrix
► zero matrix
► diagonal matrix
► square matrix

Question No: 13 ( Marks: 1 ) - Please choose one

If the arrival rate is 5 per hour and the service rate is 10 per hour, then the average system time is:
► 1/5
Selected answer 5
►1
►2

Question No: 14 ( Marks: 1 ) - Please choose one



If the arrival rate is 5 per hour and the service rate is 10 per hour, then (traffic intensity or
system utilization) =?

Selected answer

Question No: 15 ( Marks: 1 ) - Please choose one

Formula for the expected number in the system L is:



L
 


L
 


L



L
 
Selected answer
Question No: 16 ( Marks: 1 ) - Please choose one

If the arrival rate is 5 per hour and the service rate is 10 per hour, then the expected number in the
queue or average queue length is:

Selected answer

Question No: 17 ( Marks: 1 ) - Please choose one

Total cost per period = Item cost + Order cost + Holding cost + _____________.
Selected answer Shortage cost
► Optimum Shortage (S*)
► Economic Oreder Quantity. (Q*)
► Maximum Inventory. (I max.)

Question No: 18 ( Marks: 1 ) - Please choose one

In Manufacturing Model with no shortage, the replacement rate is finite and ___________ the
demand rate.

► greater than
Selected answer less than
► equal to

Question No: 19 ( Marks: 1 ) - Please choose one

If “Ni” be the Number of replacement made at the end of the ith week and “Pj” be the probability of
failure during the ith week, then N1 = ------------------.

► N0P1
Selected answer N1P1
► N0P0
► N1P2

Question No: 20 ( Marks: 1 ) - Please choose one

If “Ni” be the Number of replacement made at the end of the ith week and “Pj” be the probability of
failure during the ith week, then N2 = ------------------.
► N1P2 + N1P1
► N0P2 + N1P1
► N0P1 + N1P2
► N0P2 + N1P2

Question No: 21 ( Marks: 1 ) - Please choose one

The present worth of a rupee to be spent after a year is denoted by v and given by
► v = (1 + r)
► v = (1 / r)
► v = (1 + r) / 10
Selected answer v = 1/ (1 + r)

Question No: 22 ( Marks: 1 ) - Please choose one

Formula for a geometric series “x + vx + v2x + ... + vn-1x” is


n
1 v
P (n) 
1 v
Selected answer
1 v
P ( n)  x
n
1 v

1 v
P ( n) 
n
1 v

n
1 v
P (n)  x
1 v

Question No: 23 ( Marks: 1 ) - Please choose one

In replacement Models, Capital Cost = (Item / Machine Cots) – (--------------------).


► Resale Cost
► Running Cost
Selected answer Maintenance Cost
► Operating Cost

Question No: 24 ( Marks: 1 ) - Please choose one

Formula of EOQ in manufacturing model with shortages is


Q*  2C2 D / C3 (1  D / R). C3  C4 / C4

Q*  2C2 D / C3 . R / R  D
Selected answer
Q*  2C2 D / C3

► Non of them

Question No: 25 ( Marks: 1 ) - Please choose one

To identify and maintain the proper precedence relationship between activities those are not
connected by event, we introduce
► Parallel Activity
Selected answer Dummy Activity
► Sequential Activity
► None of these

Question No: 26 ( Marks: 1 ) - Please choose one

PERT is based on
► Deterministic times
Selected answer Probabilistic Times
► Dummy Times
► Estimated times

Question No: 27 ( Marks: 1 ) - Please choose one

Non-critical activities in the following network are -------

3
6
5

1 3

2
► Activity (1,2)
► Activity (2,3)
Selected answer Dummy Actvity
► Activity (1,3)

Question No: 28 ( Marks: 1 ) - Please choose one

If t0 = 10, tm = 10 and tp = 16, then S.D = _________.




Selected answer

Question No: 29 ( Marks: 1 ) - Please choose one

Which of the following is an essential characteristic of a linear programming problem?

► The relationship between variables and constraints must be linear


► The model must have an objective function
► The model must have structural constraints
Selected answer All are equivalent

Question No: 30 ( Marks: 1 ) - Please choose one

In the simplex table for a linear programming problem, we select the leaving basic variable
corresponds to --------------
► Maximum non-negative ratio
► Maximum negative ratio
Selected answer Minimum non-negative ratio
► Minimum negative ratio

Question No: 31 ( Marks: 1 ) - Please choose one

A technique for solving a linear programming problems in which artificial variables are included
with coefficients of very large number say equal 10 times of any cost coefficient of decision
variables is known as ---------
► Big M – Method.
► Least Cost Method
Hungarian Method
Branch and Bound Method

Question No: 32 ( Marks: 1 ) - Please choose one

If the __________ variables appear in the final basic set, then the LP (Linear Program)
has no solution.
► slack
► surplus
► non – basic
Selected answer artificial

Question No: 33 ( Marks: 1 ) - Please choose one

If no ___________ variable appears in the basis and the optimality conditions are
satisfied, then the current solution will be optimal one.
► artificial
Selected answer non basic
► slack
► surplus

Question No: 34 ( Marks: 1 ) - Please choose one

Min. Z = 0 and no artificial variable appears in the basic variables. __________ solution to
original problem has been found and we proceed to phase II method.

► A basic feasible
► An optimal
Selected answer An infeasible

Question No: 35 ( Marks: 1 ) - Please choose one

In Two – Phase method, if all the _____________ variables become zero, we stop the
phase I and proceed to phase-II.

► artificial
Selected answer basic
► non basic
► positive slack
► negative slack
Question No: 36 ( Marks: 1 ) - Please choose one

2 x  3 y  18
The inequality is equivalent to
2 x  3 y   18

2 x  3 y 18
Selected answer
2 x  3 y  18

2 x  3 y   18

Question No: 37 ( Marks: 1 ) - Please choose one

Which of the following order pair would minimize the objective function of the linear
programming problem; z = x + y subject to x≥3, y≥0 ?

► (3,3)
Selected answer (3,0)
► (0,3)
► (0,0)

Question No: 38 ( Marks: 1 ) - Please choose one

In which of the following models, Simplex algorithm is not preferred to use due to
laborious computations?

► Transportations models
► Degenerate Linear models
► Non-degenerate Linear models
Selected answer Dual or unbounded linear models

Question No: 39 ( Marks: 1 ) - Please choose one

Transportations models consist of ------- like the production centers and --------- which
may be the sales centers.
► (sinks, sources)
► (sources, sinks)
Selected answer (origins, sources)
► (sinks, destinations)

Question No: 40 ( Marks: 1 ) - Please choose one

To convert the transportation problem into a maximization model we have to------------.

► write the inverse of the coefficient matrix


► multiply the feasibility condition by –1
► multiply the coefficient matrix by –1
Selected answer We can’t convert the transportation problem into a maximization
problem, as it is basically a minimization problem.

Question No: 41 ( Marks: 2 )

A branch of Punjab National Bank has only one typist. Since the typing work varies in
length (number of pages to be typed), the typing rate is randomly distributed
approximating a Poisson distribution with mean service rate of 8 letters per hour. The
letters arrive at a rate of 5 per hour during the entire 8 – hour worki9ng day. If the
typewriter is valued at Rs. 1.50 per hour, Determine

Average system time.

Answer

Not Attempted
Question No: 42 ( Marks: 2 )

An oil company has 8 unit of money available for exploration of three sites. If oil is present
at a site, the probability of finding it depends upon the amount allocated for exploiting the
site as given below:
0 1 2 3 4 5 6 7 8
Site I 0.0 0.0 0.1 0.2 0.3 0.5 0.7 0.9 1.0
Site II 0.0 0.1 0.2 0.3 0.4 0.6 0.7 0.8 1.0
Site III 0.0 0.1 0.1 0.2 0.3 0.5 0.8 0.9 1.0
The probability that the oil exits at sites I, II and III is 0.4, 0.3 and 0.2 respectively; we have
to find the optimal allocating of money.
Do stage I only.

Answer

Not Attempted
Question No: 43 ( Marks: 2 )

Write the relationship between the activities.

Answer

X approches to Y
X also approches to Z
Y approches to Z
whether A and b might have the values between the centre points

Question No: 44 ( Marks: 2 )

For the mathematical form of a Transportation problem(T.P):


i m j n
min z   cij xij      (1)
i 1 j 1

subject to
j n

x
j 1
ij  ai      (2) , i  1, 2, , m(Sources)

i m

x
i 1
ij  b j      (3) , i  1, 2, , n(Destinations)

Describe the practical significance of all the above equations(1), (2) and (3).

Answer

Not Attempted
Question No: 45 ( Marks: 3 )

The milk plant at a city distributes its products by trucks, located at the loading dock. It has
its own fleet of trucks plus trucks of a private transport company. This transport company
has complained that sometimes its trucks have to wait in line and thus the company loses
money paid for a truck and driver that is only waiting. The company has asked the milk
plant management either to go in for a second loading dock or discount prices equivalent
to the waiting time, the following data available

  Average arrival rate  3 per hour


  Average service rate  4 per hour

The transport company has provided 40%of the total number of trucks. Assuming that
these rates are random according to Poisson distribution, determine

a) The probability that a truck has to wait.

b) The waiting time of a truck that waits.

Answer
The probability that a truck has to wait.

 4 4
  4
  43 1

The waiting time of a truck that waits.

round about 40 minutes of each truck.

Question No: 46 ( Marks: 3 )

A company has a machine whose cost is Rs. 30,000. Its maintenance cost and resale
value at the end of different years are as given below:

Years. 1 2 3 4 5 6
Maintenance 4500 4700 5000 5500 6500 7500
Cost.
Resale Value 27000 25300 24000 21000 18000 13000

Determine capital cost for each year.

Answer

Item / machine cost - resale cost - maintenace cost = capital cost


30000 - 13000 - 7500 => 17000-7500 = 9500
machine capital cost for year 7 is 7500

Question No: 47 ( Marks: 3 )

A firm produced three products. These products are processed on three different machines. The
time required to manufacturer one unit of each of the three products and the daily capacities of the
three machines are given in the table:

Time per unit (minutes) Machine


Machines Product 1 Product 2 Product 3 Capacity
(minutes / day)
M1 2 3 2 440
M2 4 --- 3 470
M3 2 3 --- 430

It is required to determine the daily number of units to be manufactured for each product.
The profit per unit for product 1, 2 and 3 is Rs. 4, Rs. 3 and Rs. 6 respectively. It is assumed that all
the amounts produced are consumed in the market.
Write the constraints of above Linear Programming Problem.

Answer

Transportation problem is a special class of linear programming problem in which


transport a commodity from the source to a destination in such a way that the total
transportation cost is maximum

Question No: 48 ( Marks: 3 )

Express the following Transportation problem(T.P) table into algebraic form with
proper objective function and non-negative constraints

D1 D2 D3 Suppl
y
O1 c1 c1 c1 5
1 2 3 Answer
O2 c2 c2 c2 3
1 2 3 4 x  S2  D1  5
O3 c3 c3 c3 10 S1  6 y  D1  3
1 2 3
Deman 4 6 8 S1  S2  8 z 10
d
Question No: 49 ( Marks: 5 )

1 2 3 Supply
1 1 2 6 7
7
2 0 4 2 12
10
3 3 1 5 11
1
Deman 10 10 10
d

Complete the above transportation Model by Vogel Approximation Method.


And also find the starting basic feasible solution.

Answer

1 2 3 Supply
1 1 2 6 7
7
2 0 4 2 12
10
3 3 1 5 11
1
Deman 10 10 10
d

Cost = 1 + 2 + 7(6) + 2 + 5(1) = 52


This is the initial basic solution consider u1 = 1 and v1 = 2 and v2 = 3

Question No: 50 ( Marks: 5 )

Check whether the given initial basic feasible solution is optimal or not.

1 2 6 7
7
0 4 2 12
10 2
3 1 5 11
10 1
10 10 10

Answer

1 2 3 Supply
1 1 2 6 7
7
2 0 4 2 12
10
3 3 1 5 11
1
Deman 10 10 10
d

Cost = 1 + 2 + 7(6) + 2 + 5(1) = 52


This is the initial basic solution consider u1 = 1 and v1 = 2 and v2 = 3

it is a n optimal solution according to if we put formula

Question No: 51 ( Marks: 5 )


A company cost Rs. 500 operations and maintenance costs are zero for the first year and
increased by Rs. 100 every year. If money is worth 5% every year, calculate present
worth (P(r)) for each year. The resale value of the machine is negligibly small.

Answer

for each year increase in money = 5%


means to say that company significes 105 ruppes every year the company capital must be increaing
as 105 * 500

Question No: 52 ( Marks: 5 )

Express the following linear programming problem in standard form and also construct its
initial simplex table.
Max Z = 3x+2y
Subject to constraints:
x + y ≤4
x – y ≤2
x,y ≥0

Answer

Blank Data

You might also like