CUSTOMER_CODE
SMUDE
DIVISION_CODE
SMUDE
EVENT_CODE
JULY15
ASSESSMENT_CODE MC0079_JULY15
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
4336
QUESTION_TEXT
a. Explain the two significant features of OR
b. What are the phases of operation featuring research? Explain them
SCHEME OF
EVALUATION
a.
i. Decision making ( 3 marks)
ii. Scientific approach ( 1.5 marks)
iii. On the basics of observation , a hypothesis describing how the
various factor involved are believed to Interact and the best solution to
the problem is formulated
( 1.5 marks)
iv. To test the hypothesis, an experiments is designed and executed.
Observation
b.
i. Judgment phase
ii. Research phase
iii. Action phase (4 marks)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
4337
QUESTION_TEXT
Explain the steps of Big-M-Method
SCHEME OF
EVALUATION
1.The last row of the simplex table is decomposed into two rows, the
first of which involves those terms not containing M, while the second
involves those containing M
2.The step 1 of the simplex method is applied to the last row created in
the above modification and followed by steps 2, 3 and 4 until this row
contains no negative elements.
3.Whenever an artificial variable ceases to be basic.
4. The last row is removed from the table whenever it contains all
zeroes.
5.If non zero artificial variables are present in the final basic set, then
the program has no solution.
(10 marks with explanation)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
4340
QUESTION_TEXT
Write the algorithm for Hungarian method
SCHEME OF
EVALUATION
Step 1: locate the smallest cost element in each row of the cost table.
Step 2: in the reduced cost table obtained, considered each column and
locate the smallest element in the subtract the smallest value from
every other entry in the column.
Step 3: Draw the minimum number of horizontal and vertical lines that
are require to cover all the ‘zero’ elements.
Step 4: Select the smallest uncovered cost element.
Step 5: Repeat steps 3 An 4 until an optimal solution is obtained.
Step 6: Given the optimal solution. Make the job assignments as
indicated by the zero elements.
(10 marks with explanation)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
72951
QUESTION_TEXT
Explain the three basic phases in project scheduling by PERT-CPM.
Also write the major components of PERT/CPM.
SCHEME OF
EVALUATION
1. Project planning (3 marks)
2. Scheduling (3 marks)
3. Project control (1 marks)
Major components:
a. Events (1 marks)
b. Activities
(2 marks)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
72953
QUESTION_TEXT
Define 2 person zero sum game; Write the characteristics of 2 person
Zero sum game. Also write the steps of construction of pay off matrix
SCHEME OF
EVALUATION
2 person Zero Game:A game with 2 players where a gain of one player equals the loss to
the other is known as a 2 person Zero –sum game (2 Marks)
Characteristics of 2 person Zero sum game: (4 Marks)
a. Only 2 players participate
b. Each player has finite number of strategies to use
c. Each specific strategy results in a pay off
d. Total pay off to the 2 players at the end of each play is zero.
Construction of pay off matrix: (4 Marks)
1. Step(i)
2.
3.
Step(ii)
Step(iii)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
116760
a.
List out the characteristics of the standard form of LPP.
b.
Explain simplex algorithm.
QUESTION_TEXT
a.
The Standard form of LPP
The characteristics of the standard form are :
i.
All constraints are equations except for the non-negativity
condition which remain inequalities (, 0) only.
ii.
The righthand side element of each constraint equation is nonnegative.
iii.
All variables are non-negative.
iv. The objective function is of the maximization or minimization
type.
(4 marks)
b.
SCHEME OF
EVALUATION
Simplex Algorithm
i.
Locate the most negative number in the last (bottom) row of the
simplex table, excluding that of last column and call the column in which
this number appears as the work (pivot) column.
ii.
Form ratios by dividing each positive number in the work column,
excluding that of the last row into the element in the same row and last
column. Designate that element in the work column that yields the
smallest ratio as the pivot element. If more than one element yields the
same smallest ratio choose arbitrarily one of them. If no element in the
work column is non negative the program has no solution.
iii. Use elementary row operations to convert the pivot element to
unity (1) and then reduce all other elements in the work column to zero.
iv. Replace the x -variable in the pivot row and first column by xvariable in the first row pivot column. The variable which is to be replaced
is called the outgoing variable and the variable that replaces is called the
incoming variable. This new first column is the current set of basic
variables.
v.
Repeat steps 1 through 4 until there are no negative numbers in the
last row excluding the last column.
vi. The optimal solution is obtained by assigning to each variable in
the first column that value in the corresponding row and last column. All
other variables are considered as non-basic and have assigned value zero.
The associated optimal value of the objective function is the number in
the last row and last column for a maximization program but the
negative of this number for a minimization problem.
(6 marks)