Management Science Set 6
On This Page
This set of Management Science Multiple Choice Questions & Answers (MCQs) focuses on Management Science Set 6
Q1 | The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the numberof positive allocations are:
- m + n
- m x n
- m +n – 1
- m +n + 1
Q2 | The method used for solving an assignment problem is:
- Reduced matrix method
- MODI method
- Hungarian method
- None of these
Q3 | An assignment problem can be solved by .........................
- Simplex method
- Transportation method
- Both a and b
- None of these
Q4 | For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans:
- n !
- (n+1) !
- (n-1) !
- n
Q5 | The assignment problem is:
- Requires that only one activity be assigned to each resource
- Is a special case of transportation problem
- Can be used to maximise resource
- All the above
Q6 | The Hungarian method for solving an assignment problem can also be used to solve:
- A transportation problem
- A travelling salesman problem
- A linear programming problem
- Both a and b
Q7 | All the parameters in the linear programming model are assumed to be .....................
- Variables
- Constraints
- Functions
- None of these
Q8 | Graphic method can be applied to solve a liner programming problem when there are only........................... variables
- A one
- Two
- Three
- More than three
Q9 | The variables whose coefficient vectors are unit vectors, are called ......................
- Unit variables
- Basic variables
- Non-basic variables
- None of these
Q10 | Any column or row of a simplex table is known as .........................
- Key column
- Key row
- Vector
- None of these
Q11 | .................... is considered as the pioneer of Linear Programming Technique.
- Churchman
- D W Miller
- James Lundy
- George B Dantzig
Q12 | A minimisation problem can be connected into maximisation problem by changing the signs ofcoefficients in the ...........................
- Constraints
- Objectives
- Both a and b
- None of these
Q13 | In an LPP, if the solution of a variable can be made infinitely large without violating theconstraints, then the solution is ..............................
- Infeasible
- Alternative
- Unbounded
- Unique
Q14 | In maximisation cases, ....................... are assigned to the artificial variables as their coefficients inthe objective function.
- + m
- – m
- None of these
Q15 | In simplex method, we add .......................... in the case of constraints with sign “=”
- Surplus variable
- Artificial variable
- Slack variable
- None of these
Q16 | In simplex method, ........................ should be selected when there is tie between slack/surplusvariable and decision variable.
- Slack variable
- Decision variable
- Surplus variable
- None of these
Q17 | When at least one of the basic variables is zero, then the basic feasible solution to a LinearProgramming Problem is said to be ..............................
- Infeasible
- Unbounded
- Degenerate
- Non-degenerate
Q18 | In Linear Programming Problem, degeneracy occurs in ................. stages.
- One
- Two
- Three
- Four
Q19 | Every Linear Programming Problem is related to another Linear Programming Problem, called..........................
- Primal
- Dual
- Non-linear Programming
- None of these
Q20 | In a maximisation assignment problem, the objective is to maximise .............................
- Profit
- Cost
- Optimisation
- None of these
Q21 | Operations Research does not give perfect solution to a problem, but it helps to improve the......................... of the solution.
- Quality
- Clarity
- Look
- None of these
Q22 | Operations Research makes a ...................... attack on complex problems to arrive at optimalsolution.
- Scientific
- Systematic
- Both a and b
- None of these
Q23 | Operations Research uses models to help the management in determining its ....................scientifically.
- Policies
- Actions
- Both a and b
- None of these
Q24 | Operations Research is a ................................
- Science
- Art
- Both a and b
- None of these