QN1. _ is an important Operations research technique to be used for determining optimal allocation of limited resources to meet the given objectives.
a) Waiting line theory
b) Net work analysis
c) Decision analysis
d) Linear programming
Answer
Answer: d) Linear programming
QN2. _ model involves all forms of diagrams
a) iconic
b) mathematical
c) analogue
d) schematic
Answer
Answer: a) iconic
QN3. An organization chart is an example of
a) Iconic
b) Mathematical
c) Analogue
d) None of the above
Answer
Answer: c) Analogue
QN4. _ is known as symbolic model
a) Iconic
b) Mathematical
c) Analogue
d) None of the above
Answer
Answer: b) Mathematical
QN5. A map indicates roads, highways, towns and the interrelationship is an _ model
a) Iconic
b) mathematical
c) analogue
d) none of the above
Answer
Answer: c) analogue
QN6. _ models in which the input and output variables follow a probability distribution.
a) Iconic
b) mathematical
c) analogue
d) Deterministic model
Answer
Answer: d) Deterministic model
QN7. _ Example of probabilistic model
a) Game theory
b) Charts
c) Graphs
d) All the above
Answer
Answer: a) Game theory
QN8. _ is a method of analyzing the current movement of the same variable in an effort to predict the future movement of the same variable.
a) Goal programming
b) Markov analysis
c) Replacement theory
d) Queuing theory
Answer
Answer: b) Markov analysis
QN9. Constraints in an LP model represent
a) Limitations
b) Requirements
c) Balancing limitation
d) all of the above
Answer
Answer: d) all of the above
QN10. Linear programming is a
a) Constraint optimization technique
b) Technique for economic allocation of limited resources.
c) Mathematical technique
d) all of the above
Answer
Answer: d) all of the above
QN11. A constraint in an LP model restricts
a) Value of objective function
b) Value of decision variable
c) Use of available resource
d) all of the above
Answer
Answer: d) all of the above
QN12. The best use of linear programming technique is to find an optimal use of
a) Money
b) Man power
c) Machine
d) all of the above
Answer
Answer: d) all of the above
QN13. Which of the following as an assumption of an LP model
a) Divisibility
b) Proportionality
c) Additively
d) all of the above
Answer
Answer: d) all of the above
QN14. Most of the constraints in the linear programming problem are expressed as _
a) Equality
b) Inequality
c) Uncertain
d) all of the above
Answer
Answer: b) Inequality
QN15. The graphical method of LP problem uses
a) Objective function equation
b) Constraint equation
c) Linear equations
d) All the above
Answer
Answer: d) All the above
QN16. A feasible solution to a linear programming problem
a) Must satisfy all problem constraints simultaneously
b) Need not satisfy all constraints
c) Must be a corner point of the feasible region
d) Must optimize the value of the objective function
Answer
Answer: a) Must satisfy all problem constraints simultaneously
QN17. While plotting constraints on a graph paper, terminal points on both axes are connected by a straight line because
a) The resources are limited in supply
b) The objective function is a linear function
c) The constraints are linear equations or in equalities
d) all of the above
Answer
Answer: c) The constraints are linear equations or in equalities
QN18. Constraints in LP problem are called active if they
a) Represent optimal solution
b) At optimality do not consume all the available resources
c) Both of (a) and (b)
d) None of the above
Answer
Answer: a) Represent optimal solution
QN19. The solution space of a LP problem is unbounded due to
a) An incorrect formulation of the LP model
b) Objective function is unbounded
c) Neither (a) nor (b)
d) Both (a) and (b)
Answer
Answer: c) Neither (a) nor (b)
QN20. While solving LP problem graphically, the area bounded by the constraints is called
a) Feasible region
b) Infeasible region
c) Unbounded solution
d) None of the above
Answer
Answer: a) Feasible region
QN21. Which of the following is not a category of linear programming problems?
a) Resource allocation problem
b) Cost benefit trade off problem
c) Distribution network problem
d) All of the above are categories of linear programming problems.
Answer
Answer: d) All of the above are categories of linear programming problems.
QN22. A linear programming model does not contain which of the following components?
a) Data
b) Decisions
c) Constraints
d) A spread sheet
Answer
Answer: d) A spread sheet
QN23. Which of the following may not be in a linear programming formulation?
a) <=. b) >.
c) =.
d) All the above
Answer
Answer: b) >.
QN24. While solving an LP problem infeasibility may be removed by
a) Adding another constraint
b) Adding another variable
c) Removing a constraint
d) Removing a variable
Answer
Answer: c) Removing a constraint
QN25. Straight lines shown in a linear programming graph indicates
a) Objective function
b) Constraints
c) Points
d) All the above
Answer
Answer: b) Constraints
QN26. All negative constraints must be written as
a) Equality
b) Non equality
c) Greater than or equal to
d) Less than or equal to
Answer
Answer: c) Greater than or equal to
QN27. In linear programming problem if all constraints are less than or equal to, then the feasible region is
a) Above lines
b) Below the lines
c) Unbounded
d) None of the above
Answer
Answer: b) Below the lines
QN28. _ is a series of related activities which result in some product or services.
a) Network
b) transportation model
c) assignment
d) none of these
Answer
Answer: a) Network
QN29. Any activity which does not consume either any resource or time is called _ activity.
a) Predecessor
b) Successor
c) Dummy
d) End
Answer
Answer: c) Dummy
QN30. An activity which must be completed before one or more other activities start is known as activity.
a) Predecessor
b) Successor
c) Dummy
c) End
Answer
Answer: a) Predecessor
QN31. Activities that cannot be started until one or more of the other activities are completed, but immediately succeed them are called _ activities
a) Predecessor
b) Successor
c) Dummy
c) End
Answer
Answer: b) Successor
QN32. An event which represents the beginning of more than one activity is known as _ event.
a) Merge
b) Net
c) Burst
d) None of the above
Answer
Answer: c) Burst
QN33. If two constraints do not intersect in the positive quadrant of the graph, then
a) The problem is infeasible
b) The solution is unbounded
c) One of the constraints is redundant
d) None of the above
Answer
Answer: d) None of the above
QN34. Constraint in LP problem are called active if they
a) Represent optimal solution
b) At optimality do not consume all the available resources
c) Both of (a) and (b)
d) None of the above
Answer
Answer: a) Represent optimal solution
QN35. Alternative solutions exists of an LP model when
a) One of the constraints is redundant.
b) Objective function equation is parallel to one of the constraints
c) Two constraints are parallel.
d) all of the above
Answer
Answer: b) Objective function equation is parallel to one of the constraints
QN36. While solving an LP problem, infeasibility may be removed by
a) Adding another constraint
b) Adding another variable
c) Removing a constraint
d) Removing a variable
Answer
Answer: c) Removing a constraint
QN37. _ is that sequence of activities which determines the total project time.
a) Net work
b) Critical path
c) Critical activities
d) None of the above
Answer
Answer: b) Critical path
QN38. Activities lying on the critical path are called _
a) Net work
b) Critical path
c) Critical activities
d) None of the above
Answer
Answer: c) Critical activities
QN39. It _ at which an activity can start.
a) EST
b) EFT
c) LST
d) LFT
Answer
Answer: a) EST
QN40. _ is the earliest starting time plus activity time.
a) EST
b) EFT
c) LST
d) LFT
Answer
Answer: b) EFT
