College ID

College Name
Course Code
Course Title
Teacher Name
Teacher CNIC
Teacher Contact

Question _no Course Code

1 CIT-332
2 CIT-332
3 CIT-332
4 CIT-332
5 CIT-332
6 CIT-332
7 CIT-332
8 CIT-332
9 CIT-332
10 CIT-332
11 CIT-332
12 CIT-332
13 CIT-332
14 CIT-332
15 CIT-332
16 CIT-332
17 CIT-332
18 CIT-332
19 CIT-332
20 CIT-332
21 CIT-332
22 CIT-332
23 CIT-332
24 CIT-332
25 CIT-332
26 CIT-332
27 CIT-332
28 CIT-332
29 CIT-332
30 CIT-332
31 CIT-332
32 CIT-332
33 CIT-332
34 CIT-332
35 CIT-332
 36 CIT-332
37 CIT-332
38 CIT-332
39 CIT-332
40 CIT-332
41 CIT-332
42 CIT-332
43 CIT-332
44 CIT-332
45 CIT-332
46 CIT-332
47 CIT-332
48 CIT-332
49 CIT-332
50 CIT-332

Short question
1
2
Question_Text
Operations research is the application of ____________methods to arrive at the optimal
solutions to the problems.
In Degenerate solution value of objective function _____________.
In graphical representation the bounded region is known as _________ region.
Graphical optimal value for Z can be obtained from
The linear function of variables which is to be maximized or minimized is called_____________
Linear programming problem involving only two variables can be solved by
If the value of the objective function z can be increased or decreased indefinitely, such solution is called
The _________ variable is added to the constraint of less than equal to type.
If any value in b - column of final simplex table is negative, then the solution is
From the following methods ___________ is a method to obtain initial solution to Transportation Problem.
If an artificial variable is present in the basic variable column of optimal simplex table, then the solution is
The Penalty in VAM represents difference between _________ cost of respective row / column.
Number of basic allocation in any row or column in Assignment Problem can be
The ______________ method's solution for transportation problem is sometimes an
If number of sources is not equal to number of destination in Assignment problem then it is called
The _____ method used to obtain optimum solution of travelling salesman problem.
The solution to a transportation problem with m-rows and n-columns is feasible if number of positive allocations
Dynamic programming is a mathematical technique dealing with the optimization of _______ stage decision pro
A basic solution which also satisfies the condition in which all basic variables are non negative is called
If all incoming variable column is negative then the solution is
If demand is lesser than supply then dummy demand node is added to make it a
An objective function is maximized when it is a _____________ function
In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’
In simplex method, slack, surplus and artificial variables are restricted to be
A _____________ models considers time as one of the important variable.
Operation research analysts do not
For the constraint of greater than equal to type we make use of ______________ variable.
A variable which does not appear in the basis variable (B) column of simplex table is
In Assignment Problem the value of decision variable Xij is____.
The occurrence of degeneracy while solving a transportation problem means that
One disadvantage of using North-West Corner Rule to find initial solution to the transportation problem is that
If we were to use opportunity cost value for an unused cell to test optimality, it should be
The purpose of a dummy row or column in an assignment problem is to
The method used for solving an assignment problem is called
Activity which starts only after finishing other activity is called _____________.
The Objective of network analysis to
If an activity has zero slack, it implies that
Activity which is completed before starting new activity is called___________.
Operation research approach is
A feasible solution of LPP
In a Simplex table, the pivot row is computed by
The Zj row in a simplex table for maximization represents
A feasible solution requires that all artificial variables is
In marking assignments, which of the following should be preferred?
A mathematical technique used to solve the problem of allocating limited resource among the competing activit
A mixed strategy game can be solved by ______________.
If the primal problem has n constraints and m variables then the number of constraints in the dual problem is
The non basic variables are called ______________.
If the primal has an unbound objective function value then the dual has ______________.
OR can evaluate only the effects of __________.

State phases for formulating the operations research problems.

What is difference between transportation problem and assignment problem?
 Superior College M.B.Din
CIT-332
Operation Research
Ateeq ur Rehman
34403-0494472-7
3035153000

Correct Option
scientific
One or more basic variables are zero
feasible solution
Corner points of feasible region
objective function
Graphical method
Unbounded solution
slack
infeasible
North-West
infeasible
smallest two
Exactly one
VAM
unbalanced
Hungarian
m + n -1
multi
Basic feasible solution
Unbounded solution
Balanced problem
Profit
Artificial Variable
non-negative
Dynamic Models
Predict future operation
surplus
always equal to zero
one or zero
the solution so obtained is not feasible
it does not take into account cost of transportation
most negative number
obtain balance between total activities and total resources
Hungarian method
successor
Minimize total project duration
It lies on the critical path
predecessor
Multi-disciplinary
Must satisfy all the constraints simultaneously
dividing every number in the profit row by the pivot number
net profit.
equal to zero.
Only row/column having single zero
Linear Programming problem
Graphical method
mn
shadow cost
no feasible solution
Numeric and quantifiable factors.
Option 2 Option 3
economical artistic
increases infinitely decreases infinitely
basic solution Solution
corner points of the solution region feasible solution
constraints basic requirements
Big M method Simplex method
Bounded solution Solution
artificial surplus
unbounded optimal
Hungarian Simplex
unbounded optimal
Two Largest largest and smallest
at most one at least one
NWCM LCM
unsymmetric symmetric
Simplex dominance
m+n mxn
single optimal
Feasible solution Optimal solution
Infeasible solution Feasible Solution
Simple problem Transportation problem
Cost   Passive
Surplus Variable   Slack Variable
negative    multiplied

Static Models Integer Models

Collect the relevant data Build more than one model
slack artificial
never equal to zero called basic variable
no restriction two or one
total supply equals total demand the few allocations become negative
it is complicated to use it leads to degenerate initial solution
equal to zero most positive number
prevent a solution from becoming degenerate provide a means of representing a dummy problem
reduced matrix method MODI method
Predecessor dummy
Minimize total project cost Minimize production delays
It is a dummy activity The project progressing well
successor dummy
Artificial Intuitive
Need not satisfy all the constraints, only some o Must be a corner point of the feasible region
dividing every number in the pivot row by the co dividing every number in the net profit row by the
gross profit. profit per unit.
greater than zero. less than zero.
Only row having single zero Only column having single zero
Assignment Problem Replacement Problem
Simplex method Hungarian method
m+n m-n
opportunity cost slack variable
basic feasible solution basic solution
Personnel factors. Financial factors

csi-404
Option 4
Management
basic variables are nonzero
optimal
none of the above
none of them
none of these
None of the above
basic
None of these
Newton Raphson
None of these
none of them
none of them
None of these
balanced
graphical
all of the above
none of them
None of the above
None of the options
None of the above
None of the options
None of the options
divided
None of the above
Recommend decision and accept
basic
None of them
None of them
None of them
all of the above
all of the above
none of the above
none of the above
none of the above
All of the above
None of the above
none of the above
all of the above
all of the above
none of the above
none of the above
none of the above
Column having more than one zero
Non linear Programming Problem
Degeneracy
m/n
surplus variable
solution
all of the above