Management Science Set 2
On This Page
This set of Management Science Multiple Choice Questions & Answers (MCQs) focuses on Management Science Set 2
Q1 | A constraint in an LP model restricts
- value of objective function
- value of decision variable
- use of available resource
- all of the above
Q2 | The best use of linear programming technique is to find an optimal use of
- money
- man power
- machine
- all of the above
Q3 | Which of the following as an assumption of an LP model
- divisibility
- proportionality
- additively
- all of the above
Q4 | Most of the constraints in the linear programming problem are expressed as ……….
- equality
- inequality
- uncertain
- all of the above
Q5 | The graphical method of LP problem uses
- objective function equation
- constraint equation
- linear equations
- all the above
Q6 | A feasible solution to a linear programming problem
- must satisfy all problem constraints simultaneously
- need not satisfy all constraints
- must be a corner point of the feasible region
- must optimize the value of the objective function
Q7 | While plotting constraints on a graph paper, terminal points on both axes are connectedby a straight line because
- the resources are limited in supply
- the objective function is a linear function
- the constraints are linear equations or in equalities
- all of the above
Q8 | Constraints in LP problem are called active if they
- represent optimal solution
- at optimality do not consume all the available resources
- both of (a) and (b)
- none of the above
Q9 | The solution space of a LP problem is unbounded due to
- an incorrect formulation of the lp model
- objective function is unbounded
- neither (a) nor (b)
- both (a) and (b)
Q10 | While solving LP problem graphically, the area bounded by the constraints is called
- feasible region
- infeasible region
- unbounded solution
- none of the above
Q11 | Which of the following is not a category of linear programming problems?
- resource allocation problem
- cost benefit trade off problem
- distribution network problem
- all of the above are categories of linear programming problems.
Q12 | A linear programming model does not contain which of the following components?
- data
- decisions
- constraints
- a spread sheet
Q13 | Which of the following may not be in a linear programming formulation?
- <=.
- >.
- 0
- all the above
Q14 | While solving an LP problem infeasibility may be removed by
- adding another constraint
- adding another variable
- removing a constraint
- removing a variable
Q15 | Straight lines shown in a linear programming graph indicates
- objective function
- constraints
- points
- all the above
Q16 | All negative constraints must be written as
- equality
- non equality
- greater than or equal to
- less than or equal to
Q17 | In linear programming problem if all constraints are less than or equal to, then thefeasible region is
- above lines
- below the lines
- unbounded
- none of the above
Q18 | ………. is a series of related activities which result in some product or services.
- network
- transportation model
- assignment
- none of these
Q19 | An event which represents the beginning of more than one activity is known as………..event.
- merge
- net
- burst
- none of the above
Q20 | If two constraints do not intersect in the positive quadrant of the graph, then
- the problem is infeasible
- the solution is unbounded
- one of the constraints is redundant
- none of the above
Q21 | Constraint in LP problem are called active if they
- represent optimal solution
- at optimality do not consume all the available resources
- both of (a) and (b)
- none of the above
Q22 | Alternative solutions exists of an LP model when
- one of the constraints is redundant.
- objective function equation is parallel to one of the constraints
- two constraints are parallel.
- all of the above
Q23 | While solving an LP problem, infeasibility may be removed by
- adding another constraint
- adding another variable
- removing a constraint
- removing a variable
Q24 | ………..is that sequence of activities which determines the total project time.
- net work
- critical path
- critical activities
- none of the above
Q25 | Activities lying on the critical path are called………….
- net work
- critical path
- critical activities
- none of the above