McqMate
| 101. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are the representation of reality |
| A. | Models |
| B. | Phases |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Models | |
| 102. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are called mathematical models |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 103. |
It is not easy to make any modification or improvement in |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 104. |
In ‐‐‐‐‐‐‐‐‐‐ models one set of properties is used to represent another set of properties |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» A. Iconic Models | |
| 105. |
Allocation Models are ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Iconic models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» C. Symbolic Models | |
| 106. |
Probabilistic models are also known as |
| A. | Deterministic Models |
| B. | Stochastic Models |
| C. | Dynamic Models |
| D. | Static Models |
| Answer» B. Stochastic Models | |
| 107. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models assumes that the values of the variables do not change with time during a particular period |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Static Models | |
| 108. |
A ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ models considers time as one of the important variable |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 109. |
Replacement Model is a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ model |
| A. | Static Models |
| B. | Dynamic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Dynamic Models | |
| 110. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ may be defined as a method of determining an optimum programme inter dependent activities in view of available resources |
| A. | Goal Programming |
| B. | Linear Programming |
| C. | Decision Making |
| D. | None of the above |
| Answer» B. Linear Programming | |
| 111. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ are expressed is n the form of inequities or equations |
| A. | Constraints |
| B. | Objective Functions |
| C. | Both A and B |
| D. | None of the above |
| Answer» A. Constraints | |
| 112. |
The objective functions and constraints are linear relationship between ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | All of the above |
| Answer» A. Variables | |
| 113. |
Assignment problem helps to find a maximum weight identical in nature in a weighted ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Tripartite graph |
| B. | Bipartite graph |
| C. | Partite graph |
| D. | None of the above |
| Answer» B. Bipartite graph | |
| 114. |
All the parameters in the linear programming model are assumed to be ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Variables |
| B. | Constraints |
| C. | Functions |
| D. | None of the above |
| Answer» B. Constraints | |
| 115. |
The solution need not be in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ numbers |
| A. | Prime Number |
| B. | Whole Number |
| C. | Complex Number |
| D. | None of the above |
| Answer» B. Whole Number | |
| 116. |
Graphic method can be applied to solve a LPP when there are only ‐‐‐‐‐‐‐‐‐‐‐‐‐ variable |
| A. | One |
| B. | More than One |
| C. | Two |
| D. | Three |
| Answer» C. Two | |
| 117. |
If the feasible region of a LPP is empty, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Infeasible | |
| 118. |
The variables whose coefficient vectors are unit vectors are called ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Unit Variables |
| B. | Basic Variables |
| C. | Non basic Variables |
| D. | None of the above |
| Answer» B. Basic Variables | |
| 119. |
Any column or raw of a simplex table is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Vector |
| B. | Key column |
| C. | Key Raw |
| D. | None of the above |
| Answer» A. Vector | |
| 120. |
A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Constraints |
| B. | Objective Functions |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Objective Functions | |
| 121. |
If in a LPP , the solution of a variable can be made infinity large without violating the constraints, the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» B. Unbounded | |
| 122. |
In maximization cases , ‐‐‐‐‐‐‐‐‐‐‐‐‐ are assigned to the artificial variables as their coefficients in the objective function |
| A. | +m |
| B. | –m |
| C. | 0 |
| D. | None of the above |
| Answer» A. +m | |
| 123. |
In simplex method , we add ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables in the case of ‘=’ |
| A. | Slack Variable |
| B. | Surplus Variable |
| C. | Artificial Variable |
| D. | None of the above |
| Answer» C. Artificial Variable | |
| 124. |
In simplex method, if there is tie between a decision variable and a slack (or surplus) variable, ‐‐‐ ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ should be selected |
| A. | Slack variable |
| B. | Surplus variable |
| C. | Decision variable |
| D. | None of the above |
| Answer» C. Decision variable | |
| 125. |
A BFS of a LPP is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ if at least one of the basic variable is zero |
| A. | Degenerate |
| B. | Non‐degenerate |
| C. | Infeasible |
| D. | Unbounded |
| Answer» A. Degenerate | |
| 126. |
In LPP, degeneracy occurs in ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ stages |
| A. | One |
| B. | Two |
| C. | Three |
| D. | Four |
| Answer» B. Two | |
| 127. |
Every LPP is associated with another LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Non‐linear programming |
| D. | None of the above |
| Answer» B. Dual | |
| 128. |
As for maximization in assignment problem, the objective is to maximize the ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Profit |
| B. | optimization |
| C. | cost |
| D. | None of the above |
| Answer» A. Profit | |
| 129. |
If there are more than one optimum solution for the decision variable the solution is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» C. Alternative | |
| 130. |
Dual of the dual is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Primal |
| B. | Dual |
| C. | Alternative |
| D. | None of the above |
| Answer» A. Primal | |
| 131. |
Operations Research approach is |
| A. | Multi‐disciplinary |
| B. | Scientific |
| C. | Initiative |
| D. | All of the above |
| Answer» C. Initiative | |
| 132. |
For analyzing the problem , decision – makers should normally study |
| A. | Its qualitative aspects |
| B. | Its quantitative aspects |
| C. | Both A and B |
| D. | Neither A and B |
| Answer» A. Its qualitative aspects | |
| 133. |
Decision variables are |
| A. | Controllable |
| B. | Uncontrollable |
| C. | Parameters |
| D. | None of the above |
| Answer» D. None of the above | |
| 134. |
The issue of decision models |
| A. | Is possible when the variable’s value is |
| B. | Reduces the scope of judgment and intuition known with certainty in decision making |
| C. | Requires the knowledge of computer software use |
| D. | None of the above |
| Answer» D. None of the above | |
| 135. |
‐‐‐‐‐‐‐‐‐‐‐‐‐ is one of the fundamental combinatorial optimization problems. |
| A. | Assignment problem |
| B. | Transportation problem |
| C. | Optimization Problem |
| D. | None of the above |
| Answer» A. Assignment problem | |
| 136. |
An optimization model |
| A. | Mathematically provides the best decision |
| B. | Provides decision within its limited context |
| C. | Helps in evaluating various alternatives constantly |
| D. | All of the above |
| Answer» D. All of the above | |
| 137. |
The quantitative approach to decision analysis is a |
| A. | Logical approach |
| B. | Rational approach |
| C. | Scientific approach |
| D. | All of the above |
| Answer» C. Scientific approach | |
| 138. |
Operations Research approach is typically based on the use of |
| A. | Physical model |
| B. | Mathematical model |
| C. | Iconic model |
| D. | Descriptive model |
| Answer» B. Mathematical model | |
| 139. |
In a manufacturing process, who takes the decisions as to what quantities and which process or processes are to be used so that the cost is minimum and profit is maximum? |
| A. | Supervisor |
| B. | Manufacturer |
| C. | Producer |
| D. | Production manager |
| Answer» D. Production manager | |
| 140. |
Linear programming has been successfully applied in ‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Agricultural |
| B. | Industrial applications |
| C. | Both A and B |
| D. | Manufacturing |
| Answer» C. Both A and B | |
| 141. |
The term linearity implies ‐‐‐‐‐‐‐‐‐‐‐ among the relevant variables: |
| A. | Straight line |
| B. | Proportional relationships |
| C. | Linear lines |
| D. | Both A and B |
| Answer» D. Both A and B | |
| 142. |
Process refers to the combination of ‐‐‐‐‐‐‐‐‐‐‐‐ inputs to produce a particular output. |
| A. | one or more |
| B. | two or more |
| C. | one |
| D. | None of the above |
| Answer» A. one or more | |
| 143. |
What has always been very important in the business and industrial world, particularly with regard to problems concerning productions of commodities? |
| A. | Linear Programming |
| B. | Production |
| C. | Decision – making |
| D. | None of the above |
| Answer» C. Decision – making | |
| 144. |
What are the main questions before a production manager? |
| A. | Which commodity/ commodities to produce |
| B. | In what quantities |
| C. | By which process or processes |
| D. | All of the above |
| Answer» D. All of the above | |
| 145. |
Who pointed out that the businessman always studies his production function and his input prices and substitutes one input for another till his costs become the minimum possible? |
| A. | Alan Marshall |
| B. | Alfred Marsh |
| C. | Alfred Marshall |
| D. | None of the above |
| Answer» C. Alfred Marshall | |
| 146. |
Who invented a method of formal calculations often termed as ? |
| A. | A.V. Kantorovich |
| B. | L.V. Kantorovich |
| C. | T.S. Kantorovich |
| D. | Alfred Marshall |
| Answer» D. Alfred Marshall | |
| 147. |
Who developed Linear Programming for the purpose of scheduling the complicated procurement activities of the United States Air Force? |
| A. | George B. Dantzig |
| B. | James B. Dantzig |
| C. | George B. Dante |
| D. | George V. Dantzig |
| Answer» A. George B. Dantzig | |
| 148. |
This method of formal calculations often termed as Linear Programming was developed later in which year? |
| A. | 1947 |
| B. | 1988 |
| C. | 1957 |
| D. | 1944 |
| Answer» A. 1947 | |
| 149. |
What is being considered as one of the most versatile management tools? |
| A. | Electronic Computers |
| B. | Linear Programming |
| C. | Computer Programming |
| D. | None of the above |
| Answer» B. Linear Programming | |
| 150. |
LP is a major innovation since ‐‐‐‐‐‐‐‐‐‐‐‐ in the field of business decision – making, particularly under conditions of certainty. |
| A. | Industrial Revolution |
| B. | World War I |
| C. | World War II |
| D. | French Revolution |
| Answer» C. World War II | |
| 151. |
The world ‘Linear’ means that the relationships are represented by ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Diagonal lines |
| B. | Curved lines |
| C. | Straight lines |
| D. | Slanting lines |
| Answer» C. Straight lines | |
| 152. |
The world ‘ programming’ means taking decisions ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Systematically |
| B. | Rapidly |
| C. | Slowly |
| D. | Instantly |
| Answer» A. Systematically | |
| 153. |
Who originally called it ‘ Programming of interdependent activities in a linear structure’ but later shortened it to ‘ Linear Programming’ ? |
| A. | Dantzig |
| B. | Kantorovich |
| C. | Marshall |
| D. | None of the above |
| Answer» A. Dantzig | |
| 154. |
LP can be applied in farm management problems is relates to the allocation of resources such as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ , in such a way that is maximizes net revenue |
| A. | Acreage |
| B. | Labour |
| C. | Water supply or working capital |
| D. | All of the above |
| Answer» D. All of the above | |
| 155. |
LP model is based on the assumptions of ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Proportionality |
| B. | Additivity |
| C. | Certainty |
| D. | All of the above |
| Answer» D. All of the above | |
| 156. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ assumption means the prior knowledge of all the coefficients in the objective function, the coefficients of the constraints and the resource values. |
| A. | Proportionality |
| B. | Certainty |
| C. | Finite choices |
| D. | Continuity |
| Answer» B. Certainty | |
| 157. |
Simple linear programming problem with ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ variables can be easily solved by the graphical method. |
| A. | One decision |
| B. | Four decisions |
| C. | Three decisions |
| D. | Two decisions |
| Answer» D. Two decisions | |
| 158. |
Any solution to a LPP which satisfies the non‐ negativity restrictions of the LPP is called its ‐‐‐‐‐‐‐‐ |
| A. | Unbounded solution |
| B. | Optimal solution |
| C. | Feasible solution |
| D. | Both A and B |
| Answer» C. Feasible solution | |
| 159. |
Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called its ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solution |
| B. | Non‐basic variables |
| C. | Solution |
| D. | Basic feasible solution |
| Answer» A. Optimal solution | |
| 160. |
A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Infinity |
| B. | One |
| C. | Zero |
| D. | X |
| Answer» C. Zero | |
| 161. |
What is also defined as the non‐negative variables which are added in the LHS of the constraint to convert the inequality ‘< ‘ into an equation? |
| A. | Slack variables |
| B. | Simplex algorithm |
| C. | Key element |
| D. | None of the above |
| Answer» A. Slack variables | |
| 162. |
Which method is an iterative procedure for solving LPP in a finite number of steps ? |
| A. | Simplex algorithm |
| B. | Slack variable |
| C. | M method |
| D. | Simplex method |
| Answer» D. Simplex method | |
| 163. |
In simplex algorithm , which method is used to deal with the situation where an infeasible starting basic solution is given? |
| A. | Slack variable |
| B. | Simplex method |
| C. | M‐ method |
| D. | None of the above |
| Answer» C. M‐ method | |
| 164. |
How many methods are there to solve LPP? |
| A. | Three |
| B. | Two |
| C. | Four |
| D. | None of the above |
| Answer» B. Two | |
| 165. |
‐‐‐‐‐‐‐‐‐‐‐‐ is another method to solve a given LPP involving some artificial variable ? |
| A. | Big M method |
| B. | Method of penalties |
| C. | Two‐phase simplex method |
| D. | None of the above |
| Answer» C. Two‐phase simplex method | |
| 166. |
Which variables are fictitious and cannot have any physical meaning ? |
| A. | Optimal variable |
| B. | Decision variable |
| C. | Artificial variable |
| D. | None of the above |
| Answer» C. Artificial variable | |
| 167. |
An objective function which states the determinants of the quantity to be either maximized or minimized is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Feasible function |
| B. | Optimal function |
| C. | Criterion function |
| D. | None of the above |
| Answer» C. Criterion function | |
| 168. |
An assumption that implies that finite numbers of choices are available to a decision – maker and the decision variables do not assume negative values is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Certainty |
| B. | Continuity |
| C. | Finite choices |
| D. | None of the above |
| Answer» C. Finite choices | |
| 169. |
A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called ‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Solution |
| B. | Variable |
| C. | Linearity |
| D. | None of the above |
| Answer» A. Solution | |
| 170. |
A basic solution which also satisfies the condition in which all basic variables are non ‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Basic feasible solution |
| B. | Feasible solution |
| C. | Optimal solution |
| D. | None of the above |
| Answer» A. Basic feasible solution | |
| 171. |
All the constraints are expressed as equations and the right hand side of each constraint and all variables are non‐negative is called ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Canonical variable |
| B. | Canonical form |
| C. | Canonical solution |
| D. | Both A and B |
| Answer» B. Canonical form | |
| 172. |
An objective function is maximized when it is a ‐‐‐‐‐‐‐‐‐‐‐ function |
| A. | Passive |
| B. | Profit |
| C. | Cost |
| D. | None of the above |
| Answer» B. Profit | |
| 173. |
LPP is exactly used in solving what kind of resource allocation problems? |
| A. | Production planning and scheduling |
| B. | Transportation |
| C. | Sales and advertising |
| D. | All of the above |
| Answer» D. All of the above | |
| 174. |
Currently, LPP is used in solving a wide range of practical ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Business problems |
| B. | Agricultural problems |
| C. | Manufacturing problems |
| D. | None of the above |
| Answer» A. Business problems | |
| 175. |
‐‐‐‐‐‐‐‐‐‐‐‐‐‐ refers to the combination of one or more inputs to produce a particular output. |
| A. | Solution |
| B. | variable |
| C. | Process |
| D. | None of the above |
| Answer» C. Process | |
| 176. |
An optimum solution is considered the ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ among feasible solutions. |
| A. | Worst |
| B. | Best |
| C. | Ineffective |
| D. | None of the above |
| Answer» B. Best | |
| 177. |
Please state which statement is true. (i) All linear programming problems may not have unique solutions (ii) The artificial variable technique is not a device that does not get the starting basic feasible solution. |
| A. | Both (i) and( ii) |
| B. | (ii) only |
| C. | (i) only |
| D. | Both are incorrect |
| Answer» C. (i) only | |
| 178. |
Please state which statement is incorrect. (i) Linear programming was first formulated by an English economist L.V. Kantorovich (ii) LP is generally used in solving maximization or minimization problems subject to certain assumptions. |
| A. | (ii) only |
| B. | (i) only |
| C. | Both (i) and( ii) |
| D. | Both are correct |
| Answer» B. (i) only | |
| 179. |
‐‐‐‐‐‐‐‐‐‐‐‐ which is a subclass of a linear programming problem (LPP) |
| A. | Programming problem |
| B. | Transportation problem |
| C. | Computer problem |
| D. | Both are incorrect |
| Answer» B. Transportation problem | |
| 180. |
The solution of any transportation problem is obtained in how many stages? |
| A. | Five |
| B. | Four |
| C. | Three |
| D. | Two |
| Answer» D. Two | |
| 181. |
An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution |
| A. | Third |
| B. | First |
| C. | Second |
| D. | Final |
| Answer» C. Second | |
| 182. |
MODI method is used to obtain ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Optimal solutions |
| B. | Optimality test |
| C. | Both A and B |
| D. | Optimization |
| Answer» C. Both A and B | |
| 183. |
For solving an assignment problem, which method is used? |
| A. | Hungarian |
| B. | American |
| C. | German |
| D. | Both are incorrect |
| Answer» A. Hungarian | |
| 184. |
To make an unbalanced assignment problem balanced, what are added with all entries as zeroes? |
| A. | Dummy rows |
| B. | Dummy columns |
| C. | Both A and B |
| D. | Dummy entries |
| Answer» C. Both A and B | |
| 185. |
Any set of non‐negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement )is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Linear programming |
| B. | Basic feasible solution |
| C. | Feasible solution |
| D. | None of the above |
| Answer» C. Feasible solution | |
| 186. |
A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | m‐n+1 |
| B. | m‐n‐1 |
| C. | m+n‐1 |
| D. | None of the above |
| Answer» C. m+n‐1 | |
| 187. |
Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Independent |
| B. | Degenerate |
| C. | Non‐degenerate |
| D. | Both A and B |
| Answer» C. Non‐degenerate | |
| 188. |
A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Occupied path |
| B. | Open path |
| C. | Closed path |
| D. | None of the above |
| Answer» C. Closed path | |
| 189. |
Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations |
| A. | Goods |
| B. | Products |
| C. | Items |
| D. | None of the above |
| Answer» A. Goods | |
| 190. |
If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Simple problem |
| B. | Balanced problem |
| C. | Transportation problem |
| D. | None of the above |
| Answer» B. Balanced problem | |
| 191. |
Basic cells indicate positive values and non‐ basic cells have ‐‐‐‐‐‐‐‐‐‐‐ value for flow |
| A. | Negative |
| B. | Positive |
| C. | One |
| D. | zero |
| Answer» D. zero | |
| 192. |
According to transportation problem number of basic cells will be exactly ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | m+n‐0 |
| B. | n+m‐1 |
| C. | m+n‐1 |
| D. | None of the above |
| Answer» C. m+n‐1 | |
| 193. |
Before starting to solve the problem, it should be balanced. If not then make it balanced by ‐‐‐‐‐ ‐‐‐‐‐‐ column incase demand is less than supply or by adding ‐‐‐‐‐‐‐‐‐‐‐‐ raw incase supply is less than the demand |
| A. | O,D |
| B. | m,n |
| C. | Horizontal, Vertical |
| D. | Unshipped supply, Shortage |
| Answer» D. Unshipped supply, Shortage | |
| 194. |
In which phase is optimization done and how does that phase also checks for optimality conditions? |
| A. | Phase II |
| B. | Phase I |
| C. | Phase II |
| D. | None of the above |
| Answer» C. Phase II | |
| 195. |
Optimality conditions are expressed as ‐‐‐‐‐‐‐‐‐‐‐‐‐ incase all non‐basic cells? |
| A. | Negligent costs |
| B. | Advanced costs |
| C. | Reduced costs |
| D. | None of the above |
| Answer» C. Reduced costs | |
| 196. |
A ‐‐‐‐‐‐‐‐‐ has rows / column having non‐ basic cells for holding compensating (+ )or (‐) sign. |
| A. | Cycle |
| B. | Dead – end |
| C. | Back track |
| D. | None of the above |
| Answer» A. Cycle | |
| 197. |
After determining every basic cell with in this cycle, adjustment is obtained as minimum value in basic cells . this is known as ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Adjustment amount |
| B. | aa |
| C. | Both A and B |
| D. | Alternatives |
| Answer» C. Both A and B | |
| 198. |
Optimal solution is a feasible solution (not necessarily basic ) which minimizes the ‐‐‐‐‐‐‐‐‐‐ |
| A. | Time taken |
| B. | Partial cost |
| C. | Total cost |
| D. | None of the above |
| Answer» C. Total cost | |
| 199. |
State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost |
| A. | both (i) and (ii) are correct |
| B. | Two only |
| C. | One only |
| D. | Both (i) and (ii) are incorrect |
| Answer» C. One only | |
| 200. |
The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐ |
| A. | Occupied cells |
| B. | Empty cells |
| C. | Both A and B |
| D. | Unoccupied cells |
| Answer» A. Occupied cells | |
Done Reading?