[OBJECTIVE]
Subject: Operation Research
Time Allowed: 15 Min
Total Marks: 10
NOTE: ATTEMPT THIS PAPER ON THIS QUESTION SHEET ONLY. Division of marks is given in front of each question. This Paper will be collected back after expiry of time limit mentioned above.
Part-I Encircle the correct option, each question carries equal marks. (05)
1. All the parameters in linear programing model are assumed to be
a) variables
b) constraints
c) functions
d) None of the above
2. Graphic method can be applied to solve a Jinear programming problem when there are only _____ variables
a) One
b) More than one
c) Two
d) Three
3. If the feasible region of the linear programming problem is empty, the solution is
a) infeasible
b) unbounded
c) alternative
d) None of the above
4. If there are “m” original variables and “n” introduced (slack) variables , then there will be ____ columns in the simplex table
a) m-n
b) m+n+3
c) m+n-1
d) m+n
5. A minimization problem can be converted into a maximization problem by changing the sign of the coefficients in the
a) constraints
b) Objective function
c) Both A and B
d) None of the above
Part-I (b) Encircle the correct option, each question carries equal marks. (05)
- Graphical method can be used for more than two decision variables (True/False)
- in simplex Method, the outgoing variable has largest value of 8. (True/Fatse)
- Business can have unconstrained problems (True/False)
- Definition of Problem is first phase of OR Study (True/False)
- Stochastic problem are easing to solve (True/Fatse)