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.
| 401. |
In simplex method, we add _____________ variables in the case of ‘=’. |
| A. | lack Variable |
| B. | urplus Variable |
| C. | rtificial Variable |
| D. | one of the above |
| Answer» D. one of the above | |
| 402. |
Which technique is used in finding a solution for optimizing a given objective, such as profit maximization or cost minimization under certain constraints? |
| A. | uailing Theory |
| B. | aiting Line |
| C. | oth A and B |
| D. | inear Programming |
| Answer» E. | |
| 403. |
What have been constructed for Operations Research problems and methods for solving the models that are available in many cases? |
| A. | cientific Models |
| B. | lgorithms |
| C. | athematical Models |
| D. | one of the above |
| Answer» D. one of the above | |
| 404. |
Operations Research is a ____________. |
| A. | cience |
| B. | rt |
| C. | athematics |
| D. | oth A and B |
| Answer» E. | |
| 405. |
Which technique is used to imitate an operation prior to actual performance ? |
| A. | imulation |
| B. | ntegrated Production Models |
| C. | nventory Control |
| D. | ame Theory |
| Answer» B. ntegrated Production Models | |
| 406. |
Key concept under which technique are network of events and activities , resource allocation, time and cost considerations, network paths and critical paths ? |
| A. | ame Theory |
| B. | etwork Analysis |
| C. | ecision Theory |
| D. | one of the above |
| Answer» C. ecision Theory | |
| 407. |
Which theory concerns making sound decisions under conditions of certainity, risk and uncertainty? |
| A. | ame Theory |
| B. | etwork Analysis |
| C. | ecision Theory |
| D. | one of the above |
| Answer» D. one of the above | |
| 408. |
Operations Research techniques helps the directing authority in optimum allocation of various limited resources, such as ______________. |
| A. | en and Machine |
| B. | oney |
| C. | aterial and Time |
| D. | ll of the above |
| Answer» E. | |
| 409. |
Linear Programming technique is used to allocate scarce resources in an optimum manner in problems of ______________ ? |
| A. | chedule |
| B. | roduct Mix |
| C. | oth A and B |
| D. | ervicing Cost |
| Answer» D. ervicing Cost | |
| 410. |
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. | rogramme Evaluation |
| B. | eview Technique (PERT) |
| C. | oth A and B |
| D. | eployment of resources |
| Answer» D. eployment of resources | |
| 411. |
Constraints in an LP model represents. |
| A. | imitations |
| B. | equirements |
| C. | alancing limitations & requirements |
| D. | ll of the above |
| Answer» E. | |
| 412. |
The distinguishing feature of an LP model is. |
| A. | elationship among all variables is linear |
| B. | t has single objective function & constraints |
| C. | alue of decision variables is non-negative |
| D. | ll of the above |
| Answer» B. t has single objective function & constraints | |
| 413. |
A constraint in an LP model restricts. |
| A. | alue of objective function |
| B. | alue of a decision variable |
| C. | se of the available resources |
| D. | ll of the above |
| Answer» E. | |
| 414. |
In a matrix of transition probability, the probability values should add up to one in each. |
| A. | ow |
| B. | olumn |
| C. | iagonal |
| D. | ll of the above |
| Answer» B. olumn | |
| 415. |
Probabilities of occurrence of any state are. |
| A. | ollectively exhaustive |
| B. | utually exclusive |
| C. | epresenting one of the finite numbers of states of nature in the system |
| D. | ll of the above |
| Answer» E. | |
| 416. |
Service mechanism in a queuing system is characterized by. |
| A. | erver’s behavior |
| B. | ustomer’s behavior |
| C. | ustomers in the system |
| D. | ll of the above |
| Answer» B. ustomer’s behavior | |
| 417. |
Which of the cost estimates & performance measures are not used for economic analysis of a queuing system? |
| A. | ost per server per unit of time |
| B. | ost per unit of time for a customer waiting in the system |
| C. | verage number of customers in the system |
| D. | verage waiting time of customers in the system |
| Answer» E. | |
| 418. |
The calling population is assumed to be infinite when. |
| A. | rrivals are independent of each other |
| B. | apacity of the system is infinite |
| C. | ervice rate is faster than arrival rate |
| D. | ll of the above |
| Answer» B. apacity of the system is infinite | |
| 419. |
Priority queue discipline may be classified as. |
| A. | inite or infinite |
| B. | imited & unlimited |
| C. | re-emptive or non-pre-emptive |
| D. | ll of the above |
| Answer» D. ll of the above | |
| 420. |
In the long run, the state probabilities become 0 & 1. |
| A. | n no case |
| B. | n same cases |
| C. | n all cases |
| D. | annot say |
| Answer» D. annot say | |
| 421. |
State transition probabilities in the Markov chain should. |
| A. | um to 1 |
| B. | e less than 1 |
| C. | e greater than 1 |
| D. | one of the above |
| Answer» B. e less than 1 | |
| 422. |
Markov analysis is useful for: |
| A. | redicting the state of the system at some future time |
| B. | alculating transition probabilities at some future time |
| C. | ll of the above |
| D. | one of the above |
| Answer» D. one of the above | |
| 423. |
The transition matrix elements remain positive from one point to the next. This property is known as: |
| A. | teady-state property |
| B. | quilibrium property |
| C. | egular property |
| D. | ll of the above |
| Answer» D. ll of the above | |
| 424. |
A problem is classified as Markov chain provided. |
| A. | here are finite number of possible states |
| B. | tates are collectively exhaustive & mutually exclusive |
| C. | ong-run probabilities of being in a particular state will be constant over time |
| D. | ll of the above |
| Answer» E. | |
| 425. |
As simulation is not an analytical model, therefore the result of simulation must be viewed as. |
| A. | nrealistic |
| B. | xact |
| C. | pproximation |
| D. | implified |
| Answer» D. implified | |
| 426. |
Which of the following is not the special purpose simulation language? |
| A. | ASIC |
| B. | PSS |
| C. | ASP |
| D. | IMSCRIPT |
| Answer» B. PSS | |
| 427. |
The purpose of using simulation technique is to. |
| A. | mitate a real-world situation |
| B. | nderstand properties & operating characteristics of complex real-life problems |
| C. | educe the cost of experiment on a model of real situation |
| D. | ll of the above |
| Answer» E. | |
| 428. |
Simulation should not be applied in all cases because it. |
| A. | equires considerable talent for model building & extensive computer programming efforts |
| B. | onsumes much computer time |
| C. | rovides at best approximate solution to problem |
| D. | ll of the above |
| Answer» E. | |
| 429. |
Large complicated simulation models are appreciated because. |
| A. | heir average costs are not well-defined |
| B. | t is difficult to create the appropriate events |
| C. | t is difficult to create the appropriate events |
| D. | ll of the above |
| Answer» D. ll of the above | |
| 430. |
Biased random sampling is made from among alternatives which have. |
| A. | qual probability |
| B. | nequal probability |
| C. | robability which do not sum to 1 |
| D. | one of the above |
| Answer» C. robability which do not sum to 1 | |
| 431. |
To make simulation more popular, we need to avoid. |
| A. | arge cost over runs |
| B. | rolonged delays |
| C. | ser dissatisfaction with simulation results |
| D. | ll of the above |
| Answer» E. | |
| 432. |
Few causes of simulation analysis failure are. |
| A. | nadequate level of user participation |
| B. | nappropriate levels of detail |
| C. | ncomplete mix of essential skills |
| D. | ll of the above |
| Answer» E. | |
| 433. |
Special simulation languages are useful because they. |
| A. | educe programme preparation time & cost |
| B. | ave the capability to generate random variables |
| C. | equire no prior programming knowledge |
| D. | ll of the above |
| Answer» E. | |
| 434. |
The important step required for simulation approach in solving a problem is to. |
| A. | est & validate the model |
| B. | esign the experiment |
| C. | onduct the experiment |
| D. | ll of the above |
| Answer» E. | |
| 435. |
A linear programming problem is shown below:Maximize 3x + 7y 3x + 7y ≤ 10Subject to 4x + 6y ≤ 8 x, y ≥ 0It has |
| A. | an unbounded objective function |
| B. | exactly one optimal solution |
| C. | exactly two optimal solutions |
| D. | infinitely many optimal solutions |
| Answer» C. exactly two optimal solutions | |
| 436. |
In waiting line problems if the arrivals are completely random, then the probability distribution of number of arrivals in a given time follows a/an |
| A. | Poisson distribution |
| B. | Normal distribution |
| C. | Exponential distribution |
| D. | Binomial distribution |
| Answer» B. Normal distribution | |
| 437. |
A self-service store employs one cashier at its counter. 8 customers arrive on an average every 5 minutes, whereas cashier can serve 10 customers in same time. Assuming Poisson distribution for service rate, the average time a customer spends in the queue will be |
| A. | 4 minutes |
| B. | 3 minutes |
| C. | 2 minutes |
| D. | 1 minute |
| Answer» D. 1 minute | |
| 438. |
If the EOQ is 360 units, order cost is Rs. 5 per order and carrying cost is Rs. 0.20 per unit, what is the usage? |
| A. | 2654 units |
| B. | 2592 units |
| C. | 1875 units |
| D. | 1574 units |
| Answer» C. 1875 units | |
| 439. |
A simple project comprises of two start-to-end parallel paths, each with three activities in series, with no interpath dependencies. The a, m, b data (in days) for each activity are shown in the diagram. Assuming that three activities in series are enough for further computations, what will be the total project duration and its standard deviation? |
| A. | 35 1 / 2 days and 14 / 3 days |
| B. | 34 1 / 2 days and 5 / 2 days |
| C. | 35 1 / 2 days and 13 / 6 days |
| D. | 34 1 / 2 days and 11 / 6 days |
| Answer» E. | |
| 440. |
A company has a store which is manned by 1 attendant who can attend to 8 technicians in an hour. The technicians want in the queue and they are attended on first-come-first-served basis. The technicians arrive at the store on an average 6 per hour. Assuming the arrivals to follow Poisson and servicing to follow exponential distribution, what is the expected time spent by a technician in the system, what is the expected time spent by a technician in the queue and what is the expected number of technicians in the queue? |
| A. | 22.5 minutes, 30 minutes and 2.75 technicians |
| B. | 30 minutes, 22.5 minutes and 2.25 technicians |
| C. | 22.5 minutes, 22.5 minutes and 2.75 technicians |
| D. | 30 minutes, 30 minutes and 2.25 technicians |
| Answer» C. 22.5 minutes, 22.5 minutes and 2.75 technicians | |
| 441. |
If Lj = the latest occurrence time for event j,Ei = the earliest occurrence time for event i,Tij = the duration of activity \(% [email protected]@[email protected]@+= % feaahqart1ev3aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq=Jc9 % vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x % fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaa8Haaeaaqa % [email protected]@ \overrightarrow{ij}\),What is the total float for activity \(% [email protected]@[email protected]@+= % feaahqart1ev3aqatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn % hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr % 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq=Jc9 % vqaqpepm0xbba9pwe9Q8fs0=yqaqpepae9pg0FirpepeKkFr0xfr=x % fr=xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaa8Haaeaaqa % [email protected]@ \overrightarrow{ij}\)? |
| A. | Ei – Lj Tij |
| B. | Lj – Ei - Tij |
| C. | Tij – Ei - Lj |
| D. | Tij – Lj + Ei |
| Answer» C. Tij – Ei - Lj | |
| 442. |
Consider the Linear Programming problem:Maximize: 7X1 + 6X2 + 4X3 subject to:X1 + X2 + X3 ≤ 5;2X1 + X2 + 3X3 ≤ 10,X1, X2, X3 ≥ 0 (Solve by algebraic method).The number of basic solutions is: |
| A. | 10 |
| B. | 7 |
| C. | 9 |
| D. | 8 |
| Answer» B. 7 | |
| 443. |
For a facility with an average arrival rate of 45 units per hour-and a service rate of 60 units per hour, with a maximum system size of 3 units, which of the following statements is true? |
| A. | The probability the system is full-is 0.1054 |
| B. | The average number of units waiting to be served and being served is 1.15 units |
| C. | The average time a unit spends waiting to be served is 1.8 minutes |
| D. | The average number of units waiting to be served is .64-units |
| Answer» B. The average number of units waiting to be served and being served is 1.15 units | |
| 444. |
A product made in two factories, P and Q, is transported to two destinations, R and S. The per unit cost of transportation (in Rupees) from factories to destinations are as per the following matrix.Factory P produces 7 units and factory Q produces 9 units of the product. Each destination requires 8 units. If the north-west corner method provides the total transportation cost as X (in Rupees) and the optimized (the minimum) total transportation cost is Y (in Rupees), in (X – Y), in rupees, is |
| A. | 0 |
| B. | 15 |
| C. | 28 |
| D. | 105 |
| Answer» D. 105 | |
| 445. |
Consider the following phases of project management:1. Identification2. Formulation3. Appraisal4. Implementation Which of the above phases are relevant, sequentially? |
| A. | 1, 2 and 3 only |
| B. | 1, 2 and 4 only |
| C. | 3 and 4 only |
| D. | 1, 2, 3 and 4 |
| Answer» E. | |
| 446. |
Direction: It consists of two statements, one labelled as ‘Statement (I)’ and the others as ‘Statement (II)’. You are to examine these two statements carefully and select the answer using the codes given below:Statement (I): Raw materials are taken as treaded items and their values at domestic and world prices are estimated.Statement (II): Raw materials, which have a high value-to-volume ratio and involve proportionately high transport cost and are imported, are regarded as non-treaded items. |
| A. | Both Statement (I) and Statement (II) are individually true and Statement (II) is the correct explanation of Statement (I) |
| B. | Both Statement (I) and Statement (II) are individually true but Statement (II) is not the correct explanation of Statement (I) |
| C. | Statement (I) is true but Statement (II) is false |
| D. | Statement (I) is false but Statement (II) is true |
| Answer» D. Statement (I) is false but Statement (II) is true | |
| 447. |
Constraints in the linear programming model represent |
| A. | requirements |
| B. | limitations |
| C. | balancing requirements and limitations |
| D. | All of the above |
| Answer» E. | |
| 448. |
After introducing slack variables s and t, the initial basic feasible solution is represented by the table below (basic variables are s = 6 and t = 6, and the objective function value is 0). - 4- 6000s32106t23016 xystRHSAfter some simplex iterations, the following table is obtained. 000212s5/301-1/32y2/3101/32 xystRHSFrom this, one can conclude that |
| A. | The LP has a unique optimal solution |
| B. | The LP has an optimal solution that is not unique |
| C. | The LP is infeasible |
| D. | The LP is unbounded |
| Answer» C. The LP is infeasible | |
| 449. |
If x is a decision variable of LPP and unrestricted in sign then this variable can be converted into x = x’ – x’’ so as to solve the LPP by simplex method, where: |
| A. | x’ ≤ 0 and x’’ ≥ 0 |
| B. | x’ ≥ 0 and x’’ ≤ 0 |
| C. | x’ and x’’ ≤ 0 |
| D. | x’ and x’’ ≥ 0 |
| Answer» E. | |
| 450. |
A linear programming model is an example of a |
| A. | probabilistic model |
| B. | deterministic model |
| C. | graphic model |
| D. | physical model |
| Answer» D. physical model | |