161. Which of the following is true with regard to a Linear Programming Model?
A. No guarantee to get integer valued solution
B. The relationship among decision variables is liner
C. Both a and b
D. None of the these
Answer
D. None of the these
162. The graphical method if LPP uses:
A. Linear equations
B. Constraint equations
C. Objective function
D. All of the above
Answer
D. All of the above
163. Constraints in an LPP are treated as active, if they:
A. Do not consume all the available resources at optimality
B. Represent optimal solution
C. Both a and b
D. None of these
Answer
B. Represent optimal solution
164. While solving a LPP graphically, the area bounded by constraints is called ___. .
A. Feasible region
B. Infeasible region
C. Unbounded region
D. None of these
Answer
A. Feasible region
165. While solving an LPP, infeasibility may be removed by:
A. Removing a variable
B. Removing a constraint
C. Adding a variable
D. Adding a constraint
Answer
B. Removing a constraint
166. ___. variables are fictitious and cannot have any physical meaning.
A. Slack variables
B. Surplus variables
C. Artificial variables
D. Decision variables
Answer
C. Artificial variables
167. An optimal solution is considered as the ___ among the feasible solutions.
A. Worst
B. Best
C. Ineffective
D. None of these
Answer
B. Best
168. ___ method is used to solve an assignment problem.
A. American method
B. Hungarian method
C. German method
D. British method
Answer
B. Hungarian method
169. The allocated cells in the transportation table are called ___ ___.
A. Occupied cells
B. Empty cells
C. Unoccupied cells
D. None of these
Answer
A. Occupied cells
170. In transportation Problems, VAM stands for ___. .
A. Value Addition Method
B. Vogel’s Approximation Method
C. Virgenean Approximation Method
D. None of these
Answer
B. Vogel’s Approximation Method
171. Initial feasible solution to a transportation Problem can be found out by ___. .
A. VAM
B. MODI Method
C. Both a and b
D. None of these
Answer
A. VAM
172. ___. is applied to determine optimal solution.
A. NWCR
B. VAM
C. MODI Method
D. None of these
Answer
C. MODI Method
173. A Transportation Problem is said to be unbalanced when total supply is not equal to ___.
A. Total cost
B. Total demand
C. Both a and b
D. None of these
Answer
B. Total demand
174. For a minimisation Transportation Problem, the objective is to minimise:
A. Profit
B. Cost
C. Solution
D. None of these
Answer
B. Cost
175. ___ is an important Operations Research Technique to analyse the queuing behaviour.
A. Game theory
B. Waiting line theory
C. Decision theory
D. Simulation
Answer
B. Waiting line theory
176. An organisation chart is an example of ___
A. Iconic model
B. Mathematical model
C. Analogue model
D. None of these
Answer
C. Analogue model
177. ___. model is a map which indicates roads, highways, towns and inter-relationships
A. Iconic model
B. Analogue model
C. Mathematical model
D. None of these
Answer
B. Analogue model
178. Operations Research techniques help to find ___ solution.
A. Feasible solution
B. Infeasible solution
C. Optimal solution
D. None of these
Answer
C. Optimal solution
179. Operations Research Techniques involves ___ approach.
A. Team approach
B. Critical approach
C. Individual approach
D. None of these
Answer
C. Individual approach
180. A LPP model doesnot contain:
A. Decision
B. Constraints
C. Feasible solution
D. Spread Sheet
Answer
D. Spread Sheet
181. Straight lines shown in a linear programming graph indicates ___
A. Objective function
B. Constraints
C. Points
D. All of the above
Answer
B. Constraints
182. Non-negativity constraints are written as ___
A. Equality
B. Non-equality
C. Greater than or equal to
D. Less than or equal to
Answer
C. Greater than or equal to
183. PERT stand for:
A. Performance Evaluation Review Technique
B. Programme Evaluation Review Technique
C. Programme Evaluation Research Technique
D. None of these
Answer
B. Programme Evaluation Review Technique
184. An activity which must be completed before commencement of one or more other activities iscalled ___ ___
A. Successor activity
B. Predecessor activity
C. Dummy activity
D. None of these
Answer
B. Predecessor activity
185. In network diagram, events are commonly represented by ___. .
A. Arrows
B. Nodes
C. Triangles
D. None of these
Answer
B. Nodes
186. ___. . is activity oriented network diagram.
A. CPM
B. PERT
C. Histogram
D. Ogive
Answer
A. CPM
187. ___ is an event oriented network diagram.
A. CPM
B. PERT
C. Histogram
D. Ogive
Answer
B. PERT
188. An activity which does not consume either resource or time is called ___ ___
A. Predecessor activity
B. Successor activity
C. Dummy activity
D. Terminal activity
Answer
C. Dummy activity
189. ___. . is a series of activities related to a project.
A. Network
B. Transportation Model
C. Assignment model
D. None of these
Answer
A. Network
190. An event which represents the beginning of more than one activity is a :
A. Merge event
B. Net event
C. Burst event
D. None of these
Answer
C. Burst event
191. Activities lying on critical path are called ___ ___
A. Critical activities
B. Non-critical activities
C. Dummy activities
D. None of these
Answer
A. Critical activities
192. Activities that cannot be started until one or more of the other activities are completed, arecalled ___
A. Dummy activities
B. Initial activities
C. Successor activities
D. Predecessor activities
Answer
C. Successor activities
193. ___ ___ is the sequence of activities which determines the total project duration.
A. Critical path
B. Network
C. Non-critical activities
D. None of these
Answer
A. Critical path
194. PERT emphasises on ___
A. Activity
B. Time
C. Cost
D. None of these
Answer
B. Time
195. ___ is the duration by which an activity can be delayed without delaying the completionof the project.
A. Earliest Start Time
B. Earliest Finish Time
C. Latest Start Time
D. Latest Finish Time
Answer
C. Latest Start Time
196. The EST + activity duration = ___ ___.
A. Earliest Finish Time
B. Latest Start Time
C. Latest Finish Time
D. None of these
Answer
A. Earliest Finish Time
197. ___ ___ is the latest time by which an activity can be finished without delaying thecompletion of the project.
A. LST
B. LFT
C. EFT
D. EST
Answer
B. LFT
198. ___. . is a scheme or design of something intended to do.
A. Network
B. Float
C. Project
D. Program
Answer
A. Network
199. In a network diagram, activity is denoted by ___ ___
A. Node
B. Arrow
C. Triangle
D. None of these
Answer
B. Arrow
200. ___ is the duration by which an activity can be delayed without delaying the project.
A. Slack
B. Total float
C. Both a and b
D. None of these
Answer
B. Total float
