MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 675 Mcqs, each offering curated multiple-choice questions to sharpen your General Management knowledge and support exam preparation. Choose a topic below to get started.
| 601. |
Decision variables are.$? |
| A. | Controllable |
| B. | Uncontrollable |
| C. | Parameters |
| D. | None of the above |
| Answer» E. | |
| 602. |
________ 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» B. Objective Functions | |
| 603. |
___________ are called mathematical models.$? |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» D. None of the above | |
| 604. |
___________ models are obtained by enlarging or reducing the size of the item.$? |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» B. Analogue Models | |
| 605. |
Operations Research study generally involves how many phases ?$? |
| A. | Three |
| B. | Four |
| C. | Five |
| D. | Two |
| Answer» B. Four | |
| 606. |
___________ are called mathematical models.? |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» D. None of the above | |
| 607. |
Decision variables are.? |
| A. | Controllable |
| B. | Uncontrollable |
| C. | Parameters |
| D. | None of the above |
| Answer» E. | |
| 608. |
Operations Research approach is typically based on the use of.? |
| A. | Physical model |
| B. | Mathematical model |
| C. | Iconic model |
| D. | Descriptive model |
| Answer» C. Iconic model | |
| 609. |
________ 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» B. Objective Functions | |
| 610. |
Operations Research study generally involves how many phases ?? |
| A. | Three |
| B. | Four |
| C. | Five |
| D. | Two |
| Answer» B. Four | |
| 611. |
___________ models are obtained by enlarging or reducing the size of the item.? |
| A. | Iconic Models |
| B. | Analogue Models |
| C. | Symbolic Models |
| D. | None of the above |
| Answer» B. Analogue Models | |
| 612. |
Who defined Operations Research as scientific method of providing executive departments with a quantitative basis for decisions regarding the operations under their control?? |
| A. | Morse and Kimball (1946) |
| B. | P.M.S. Blackett (1948) |
| C. | E.L. Arnoff and M.J. Netzorg |
| D. | None of the above |
| Answer» B. P.M.S. Blackett (1948) | |
| 613. |
Who defined Operations Research as scientific approach to problem solving for executive management ?? |
| A. | E.L. Arnoff |
| B. | P.M.S. Blackett |
| C. | H.M. Wagner |
| D. | None of the above |
| Answer» D. None of the above | |
| 614. |
Every mathematical model. |
| A. | Must be deterministic |
| B. | Requires computer aid for its solution |
| C. | Represents data in numerical form |
| D. | All of the above |
| Answer» D. All of the above | |
| 615. |
The Hungarian method for solving an assignment problem can also be used to solve. |
| A. | A transportation problem |
| B. | A travelling salesman problem |
| C. | A LP problem |
| D. | Both a & b |
| Answer» C. A LP problem | |
| 616. |
Which of the following is not a key operating characteristics apply to queuing system? |
| A. | Utilization factor |
| B. | Percent idle time |
| C. | Average time spent waiting in the system & queue |
| D. | None of the above |
| Answer» E. | |
| 617. |
In Markov analysis, state probabilities must. |
| A. | Sum to one |
| B. | Be less than one |
| C. | Be greater than one |
| D. | None of the above |
| Answer» B. Be less than one | |
| 618. |
The cost of providing service in a queuing system decreases with. |
| A. | Decreased average waiting time in the queue |
| B. | Decreased arrival rate |
| C. | Increased arrival rate |
| D. | None of the above |
| Answer» E. | |
| 619. |
The general purpose system simulation language. |
| A. | Requires programme writing |
| B. | Does not require programme writing |
| C. | Requires predefined coding forms |
| D. | Needs a set of equations to describe a system |
| Answer» C. Requires predefined coding forms | |
| 620. |
Analytical results are taken into consideration before a simulation study so as to. |
| A. | Identify suitable values of the system parameters |
| B. | Determine the optimal decision |
| C. | Identify suitable values of decision variables for the specific choices of system parameters |
| D. | All of the above |
| Answer» D. All of the above | |
| 621. |
An advantage of simulation as opposed to optimization is that. |
| A. | Several options of measure of performance can be examined |
| B. | Complex real-life problems can be studied |
| C. | It is applicable in cases where there is an element of randomness in a system |
| D. | All of the above |
| Answer» E. | |
| 622. |
The first-order Markov chain is generally used when. |
| A. | Transition probabilities are fairly stable |
| B. | Change in transition probabilities is random |
| C. | No sufficient data are available |
| D. | All of the above |
| Answer» B. Change in transition probabilities is random | |
| 623. |
Linear programming is a. |
| A. | Constrained optimization technique |
| B. | Technique for economic allocation of limited resources |
| C. | Mathematical technique |
| D. | All of the above |
| Answer» E. | |
| 624. |
What refers to Linear Programming that includes an evaluation of relative risks and uncertainties in various alternatives of choice for management decisions ? |
| A. | Probabilistic Programming |
| B. | Stochastic Programming |
| C. | Both A and B |
| D. | Linear Programming |
| Answer» D. Linear Programming | |
| 625. |
Operations Research simply helps in improving the ______________ of the solution but does not in a perfect solution. |
| A. | Quality |
| B. | Clarity |
| C. | Look |
| D. | None of the above |
| Answer» B. Clarity | |
| 626. |
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» D. None of the above | |
| 627. |
What can be defined as a useful idle resource which has economic value eg; raw materials, spareparts, finished items, etc? |
| A. | Inventory Control |
| B. | Inventory |
| C. | Inventory Planning |
| D. | None of the above |
| Answer» C. Inventory Planning | |
| 628. |
The mathematical model of an LP problem is important because. |
| A. | It helps in converting the verbal description & numerical data into mathematical expression |
| B. | Decision-makers prefer to work with formal models |
| C. | It captures the relevant relationship among decision factors |
| D. | It enables the use of algebraic technique |
| Answer» B. Decision-makers prefer to work with formal models | |
| 629. |
Before formulating a formal LP model, it is better to. |
| A. | Express each constrain in words |
| B. | Express the objective function in words |
| C. | Verbally identify decision variables |
| D. | All of the above |
| Answer» E. | |
| 630. |
If there are ‘m’ original variables and ‘n’ introduced variables, then there will be _____________ columns in the simplex table.$ |
| A. | M + n |
| B. | M – n |
| C. | 3 +m + n |
| D. | M + n – 1 |
| Answer» D. M + n ‚Äö√Ñ√¨ 1 | |
| 631. |
While solving a LP problem, infeasibility may be removed by? |
| A. | Adding another constraint |
| B. | Adding another variable |
| C. | Removing a constraint |
| D. | Removing a variable |
| Answer» D. Removing a variable | |
| 632. |
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» B. The solution is unbounded | |
| 633. |
Which of the following statements is true with respect to the optimal solution of an LP problem? |
| A. | Every LP problem has an optimal solution |
| B. | Optimal solution of an LP problem always occurs at an extreme point |
| C. | At optimal solution all resources are completely used |
| D. | If an optimal solution exists, there will always be at least one at a corner |
| Answer» E. | |
| 634. |
Non-negativity condition in an LP model implies. |
| A. | A positive coefficient of variables in objective function |
| B. | A positive coefficient of variables in any constraint |
| C. | Non-negative value of resources |
| D. | None of the above |
| Answer» E. | |
| 635. |
The solution need not be in ___________ numbers. |
| A. | Prime Number |
| B. | Whole Number |
| C. | Complex Number |
| D. | None of the above |
| Answer» C. Complex Number | |
| 636. |
The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that. |
| A. | The solution be optimal |
| B. | The rim conditions are satisfied |
| C. | The solution not be degenerate |
| D. | All of the above |
| Answer» C. The solution not be degenerate | |
| 637. |
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.$ |
| A. | m+n |
| B. | m*n |
| C. | m+n-1 |
| D. | m+n+1 |
| Answer» D. m+n+1 | |
| 638. |
When total supply is equal to total demand in a transportation problem, the problem is said to be? |
| A. | Balanced |
| B. | Unbalanced |
| C. | Degenerate |
| D. | None of the above |
| Answer» D. None of the above | |
| 639. |
While solving an assignment problem, an activity is assigned to a resource through a square with zero opportunity cost because the objective is to? |
| A. | Minimize total cost of assignment |
| B. | Reduce the cost of assignment to zero |
| C. | Reduce the cost of that particular assignment to zero |
| D. | All of the above |
| Answer» B. Reduce the cost of assignment to zero | |
| 640. |
For a salesman who has to visit n cities which of the following are the ways of his tour plan. |
| A. | n! |
| B. | (n+1)! |
| C. | (n-1)! |
| D. | n |
| Answer» D. n | |
| 641. |
___________ are the representation of reality. |
| A. | Models |
| B. | Phases |
| C. | Both A and B |
| D. | None of the above |
| Answer» B. Phases | |
| 642. |
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» B. Its quantitative aspects | |
| 643. |
The quantitative approach to decision analysis is a. |
| A. | Logical approach |
| B. | Rational approach |
| C. | Scientific approach |
| D. | All of the above |
| Answer» D. All of the above | |
| 644. |
______________ 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» C. Decision Making | |
| 645. |
Operations Research cannot give perfect __________ to problems. |
| A. | Answers |
| B. | Solutions |
| C. | Both A and B |
| D. | Decisions |
| Answer» D. Decisions | |
| 646. |
In ___________ models there is risk and uncertainty. |
| A. | Deterministic Models |
| B. | Probabilistic Models |
| C. | Both A and B |
| D. | None of the above |
| Answer» C. Both A and B | |
| 647. |
Operations Research was known as an ability to win a war without really going in to a _____________. |
| A. | Battle field |
| B. | Fighting |
| C. | War |
| D. | Both A and B |
| Answer» E. | |
| 648. |
Who coined the term Operations Research? |
| A. | J.F. McCloskey |
| B. | F.N. Trefethen |
| C. | P.F. Adams |
| D. | Both A and B |
| Answer» E. | |
| 649. |
The use of decision models. |
| A. | Is possible when the variables value is known |
| B. | Reduces the scope of judgement & intuition known with certainty in decision-making |
| C. | Require the use of computer software |
| D. | None of the above |
| Answer» E. | |
| 650. |
To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are. |
| A. | n |
| B. | 2n |
| C. | n-1 |
| D. | 2n-1 |
| Answer» D. 2n-1 | |