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.
| 551. |
_ Which of the following is not a characteristic of the LP model?$? |
| A. | Alternative courses of action |
| B. | An objective function of maximization type |
| C. | Limited amount of resources |
| D. | Non-negativity condition on the value of decision variables. |
| Answer» C. Limited amount of resources | |
| 552. |
_ 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» C. Alternative | |
| 553. |
_ If one of the constraint of an equation in an LP problem has an unbounded solution, then.$? |
| A. | Solution to such LP problem must be degenerate |
| B. | Feasible region should have a line segment |
| C. | Alternative solutions exist |
| D. | None of the above |
| Answer» C. Alternative solutions exist | |
| 554. |
_ The solution space (region) of an 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 & b |
| Answer» D. Both a & b | |
| 555. |
_ If an iso-profit line yielding the optimal solution coincides with a constaint line, then.$? |
| A. | The solution is unbounded |
| B. | The solution is infeasible |
| C. | The constraint which coincides is redundant |
| D. | None of the above |
| Answer» E. | |
| 556. |
_ Which of the following is a limitation associated with an LP model?$? |
| A. | The relationship among decision variables in linear |
| B. | No guarantee to get integer valued solutions |
| C. | No consideration of effect of time & uncertainty on LP model |
| D. | All of the above |
| Answer» E. | |
| 557. |
_ If the feasible region of a LPP is empty, the solution is ______________.$? |
| A. | Infeasible |
| B. | Unbounded |
| C. | Alternative |
| D. | None of the above |
| Answer» B. Unbounded | |
| 558. |
_ The occurrence of degeneracy while solving a transportation problem means that.$? |
| A. | Total supply equals total demand |
| B. | The solution so obtained is not feasible |
| C. | The few allocations become negative |
| D. | None of the above |
| Answer» C. The few allocations become negative | |
| 559. |
_ During an iteration while moving from one solution to the next, degeneracy may occur when.$? |
| A. | The closed path indicates a diagonal move |
| B. | Two or more occupied cells are on the closed path but neither of them represents a corner of the path. |
| C. | Two or more occupied cells on the closed path with minus sign are tied for lowest circled value |
| D. | Either of the above |
| Answer» D. Either of the above | |
| 560. |
_ The degeneracy in the transportation problem indicates that.$? |
| A. | Dummy allocation(s) needs to be added |
| B. | The problem has no feasible solution |
| C. | The multiple optimal solution exist |
| D. | a & b but not c |
| Answer» D. a & b but not c | |
| 561. |
_ The purpose of a dummy row or column in an assignment problem is to.$? |
| A. | Obtain balance between total activities & total resources |
| B. | Prevent a solution from becoming degenerate |
| C. | Provide a means of representing a dummy problem |
| D. | None of the above |
| Answer» B. Prevent a solution from becoming degenerate | |
| 562. |
_ An assignment problem is a special case of transportation problem, where.$? |
| A. | Number of rows equals number of columns |
| B. | All rim conditions are 1 |
| C. | Values of each decision variable is either 0 or 1 |
| D. | All of the above |
| Answer» E. | |
| 563. |
__Probabilistic models are also known as.__ |
| A. | Deterministic Models |
| B. | Stochastic Models |
| C. | Dynamic Models |
| D. | Static Models |
| Answer» C. Dynamic Models | |
| 564. |
_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» E. | |
| 565. |
_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» E. | |
| 566. |
_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» D. None of the above | |
| 567. |
___________ models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized.$? |
| A. | Sequencing |
| B. | Allocation Models |
| C. | Queuing Theory |
| D. | Decision Theory |
| Answer» C. Queuing Theory | |
| 568. |
_Operations Research attempts to find the best and __________ solution to a problem.$? |
| A. | Optimum |
| B. | Perfect |
| C. | Degenerate |
| D. | None of the above |
| Answer» B. Perfect | |
| 569. |
_Operations Research has the characteristics the it is done by a team of _____________.$? |
| A. | Scientists |
| B. | Mathematicians |
| C. | Academics |
| D. | All of the above |
| Answer» B. Mathematicians | |
| 570. |
_Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis ?$? |
| A. | C. Kitte |
| B. | H.M. Wagner |
| C. | E.L. Arnoff |
| D. | None of the above |
| Answer» B. H.M. Wagner | |
| 571. |
_A physical model is example of.$? |
| A. | An iconic model |
| B. | An analogue model |
| C. | A verbal model |
| D. | A mathematical model |
| Answer» D. A mathematical model | |
| 572. |
_An optimal solution of an assignment problem can be obtained only if.$? |
| A. | Each row & column has only one zero element |
| B. | Each row & column has at least one zero element |
| C. | The data is arrangement in a square matrix |
| D. | None of the above |
| Answer» E. | |
| 573. |
_Priority queue discipline may be classified as.$? |
| A. | Finite or infinite |
| B. | Limited & unlimited |
| C. | Pre-emptive or non-pre-emptive |
| D. | All of the above |
| Answer» D. All of the above | |
| 574. |
State transition probabilities in the Markov chain should.$? |
| A. | Sum to 1 |
| B. | Be less than 1 |
| C. | Be greater than 1 |
| D. | None of the above |
| Answer» B. Be less than 1 | |
| 575. |
Service mechanism in a queuing system is characterized by.$? |
| A. | Server’s behavior |
| B. | Customer’s behavior |
| C. | Customers in the system |
| D. | All of the above |
| Answer» B. Customer‚Äö√Ñ√¥s behavior | |
| 576. |
Special simulation languages are useful because they.$? |
| A. | Reduce programme preparation time & cost |
| B. | Have the capability to generate random variables |
| C. | Require no prior programming knowledge |
| D. | All of the above |
| Answer» E. | |
| 577. |
Biased random sampling is made from among alternatives which have.$? |
| A. | Equal probability |
| B. | Unequal probability |
| C. | Probability which do not sum to 1 |
| D. | None of the above |
| Answer» C. Probability which do not sum to 1 | |
| 578. |
The purpose of using simulation technique is to.$? |
| A. | Imitate a real-world situation |
| B. | Understand properties & operating characteristics of complex real-life problems |
| C. | Reduce the cost of experiment on a model of real situation |
| D. | All of the above |
| Answer» E. | |
| 579. |
A problem is classified as Markov chain provided.$? |
| A. | There are finite number of possible states |
| B. | States are collectively exhaustive & mutually exclusive |
| C. | Long-run probabilities of being in a particular state will be constant over time |
| D. | All of the above |
| Answer» E. | |
| 580. |
A constraint in an LP model restricts.$? |
| A. | Value of objective function |
| B. | Value of a decision variable |
| C. | Use of the available resources |
| D. | All of the above |
| Answer» E. | |
| 581. |
What enables us to determine the earliest and the latest times for each of the events and activities and thereby helps in the identification of the critical path?$? |
| A. | Programme Evaluation |
| B. | Review Technique (PERT) |
| C. | Both A and B |
| D. | Deployment of resources |
| Answer» D. Deployment of resources | |
| 582. |
Operations Research involves ______________ attack of complex problems to arrive at the optimum solution.$? |
| A. | Scientific |
| B. | Systematic |
| C. | Both A and B |
| D. | Statistical |
| Answer» D. Statistical | |
| 583. |
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» B. Non_degenerate | |
| 584. |
Which theory concerns making sound decisions under conditions of certainity, risk and uncertainty?$? |
| A. | Game Theory |
| B. | Network Analysis |
| C. | Decision Theory |
| D. | None of the above |
| Answer» D. None of the above | |
| 585. |
Operations Research is a ____________.$? |
| A. | Science |
| B. | Art |
| C. | Mathematics |
| D. | Both A and B |
| Answer» E. | |
| 586. |
Maximization of objective function in an LP model means.$? |
| A. | Value occurs at allowable set of decisions |
| B. | Highest value is chosen among allowable decisions |
| C. | Neither of above |
| D. | Both a & b |
| Answer» B. Highest value is chosen among allowable decisions | |
| 587. |
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» C. Both A and B | |
| 588. |
If a non-redundant constraint is removed from an LP problem then.$? |
| A. | Feasible region will become larger |
| B. | Feasible region will become smaller |
| C. | Solution will become infeasible |
| D. | None of the above |
| Answer» B. Feasible region will become smaller | |
| 589. |
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 a & b |
| D. | None of the above |
| Answer» B. At optimality do not consume all the available resources | |
| 590. |
An iso-profit line represents.$? |
| A. | An infinite number of solutions all of which yield the same profit |
| B. | An infinite number of solution all of which yield the same cost |
| C. | An infinite number of optimal solutions |
| D. | A boundary of the feasible region |
| Answer» B. An infinite number of solution all of which yield the same cost | |
| 591. |
Which of the following is an assumption of an LP model?$? |
| A. | Divisibility |
| B. | Proportionality |
| C. | Additivity |
| D. | All of the above |
| Answer» E. | |
| 592. |
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» D. Three | |
| 593. |
The dummy source or destination in a transportation problem is added to.$? |
| A. | Satisfy rim conditions |
| B. | Prevent solution from becoming degenerate |
| C. | Ensure that total cost does not exceed a limit |
| D. | None of the above |
| Answer» B. Prevent solution from becoming degenerate | |
| 594. |
If an opportunity cost value is used for an unused cell to test optimality, it should be.$? |
| A. | Equal to zero |
| B. | Most negative number |
| C. | Most positive number |
| D. | Any value |
| Answer» C. Most positive number | |
| 595. |
Which of the following methods is used to verify the optimality of the current solution of the transportation problem?$? |
| A. | Least cost method |
| B. | Vogel’s approximation method |
| C. | Modified distribution method |
| D. | All of the above |
| Answer» B. Vogel‚Äö√Ñ√¥s approximation method | |
| 596. |
The method used for solving an assignment problem is called.$? |
| A. | Reduced matrix method |
| B. | MODI method |
| C. | Hungarian method |
| D. | None of the above |
| Answer» D. None of the above | |
| 597. |
The assignment problem.$? |
| A. | Requires that only one activity be assigned to each resource |
| B. | Is a special case of transportation problem |
| C. | Can be used to maximize resources |
| D. | All of the above |
| Answer» E. | |
| 598. |
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 | |
| 599. |
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) | |
| 600. |
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 | |