Scribd
Upload
165 views13 pages

MCQ of All Chapters

Uploaded by

Abhijeet Singh Baghel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
165 views13 pages

MCQ of All Chapters

Uploaded by

Abhijeet Singh Baghel
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 13
[ creNCE MULTIPLE CHOICE QUESTIONS Cha 1: : Linear ramming (Unit - 2) ne first step in solving operations research problem is epee! , model buildin , a @ re ie (b) obtain alternate solutions (0) Light variables A soy Formulati of che distinguishing feature of an LP model is ial ia) relationship among all the variables is linear (o) it has single objective function and constraints (©) value of the a is non-negative (@ all of the above the constraints of a maximisation problem are normally of ___- (a) less than or equal type \Uby Greater than or equal type (¢) {ess than type (d) greater than type Resources in a LP problem are indicated by ___- (@) objective function AK decision variables (Constraint equations (@) slack variables F ations we In graphical solution of solving LP problem, to convert inequalities into equ: (b) use surplus variables Jay-simply assume them as equations pe '<' we matk the feasible region a5 Spy the region containing the origin ] (d) the region in the first quadrant (@) use slack variables (Q. draw lines For constraints of the ty! n not containing region (c) the region on the line An iso-profit line represents : (an infinite number of solutions all of which yield the same profit (b) an infinite number 6f solutions all of which yield the maximum profit (0) aninfinite number of optimal solutions (d) a boundary of the feasible region lution of minimisation problem, (b) towards left (¢) away from the origin e optimal solution happens to be __- (b) origin 3. Ina graphical sol we move the iso-cost line ___- (a) towards right ‘towards the origin 3. Ina graphical method of LP problem, th = of the constraint line ‘one of the corner point (d) one of the central point McQ ‘Scanned with Camscanne ———E ————— DECISION SCIENCE __——— me cides with a constrai ptimal solutions coin Nstraint fing, then so-profit line yielding the o 10. Ifanit nis unbounded n is infeasible (@) the solutio ing constraint is redundant (b) the solutio (c) the coincidl (d) none of the above. Aces 5160120 18&@ [99 eo lz@ [3@14o [—___ Chapter Transportation Models (Unit - 1) tion problem is added to | The dummy source or destination in a transporta ii (df satisfy the rim conditions (b) present solution from becoming degenerate (0) ensure that the total cost does not exceed a limit (d) none of the above | ‘ The solution of a transportation problem with m-rows (supplies) and ‘columns f occupied cells are_. & (destinations) is feasible if the number 0 (2) m+n (b) mxn ef m+n-1 (@) m+tne+1 f transportation problem, we reallocate units to the 3, While improving a solution o' unoccupied cell having its opportunity cost@s (a) equal to zero ) most negative number (c) most positive number (d) any value Multiple optimal solutions for a transportation problem are indicated in the optimum table by__. : (a) occupied cells with positive opportunity costs /FCES) model, the system length Lis given by _. (a) aa p (b) Toy Be © a i= 3. _ Inthe queue model notation (a/b/c) : (d/e), what does c represent__. (@) arrival pattern (b) service pattern (Q). number of services (d) capacity of the system 4. With respect to a simple queue model which of the following is not true__ (@) L, = AW, (b) p= Lg +P (©) Ws = Wa +P (d) L, = AW, 5. For a (M/M/c) : (oo/FCFS) Queue model, the steady state exists if__. (a) A= kw (b) A> kw 7 (© waka (d) A Total Float it 10. Which of the following is not a difference between PERT ac a eee eee ae oS eeree is based on ti i i ay eee ime considerations and CPM is (©) PERT is event oriented j and CPM is activity <_(GPERT makes use of critical th while a path while CPM does not MULTIPLE CHOICE QUE in PERT calculations, the expected time of an activity (having optimistic, most likely and pessimistic time estimates a, m, b respecti pe '2£am+b) spectively) is found out by __ oo (oy 2zemeb aa 2 © @ (24) the project duration of a PERT network the following is not true _- (a) its standard deviation is equal to sum of the standard deviations of critical activities (p) it follows normal probability distribution (0) its expected time is the sum of the expected times of the critical activities (a) its expected time is given by the length of critical path ANSWERS 0120 13@ 140750 ]eol7@]a@ | 9.) | 10o 1 @ | 12.@) | aan Chapter 11: Sequencing Problems (Unit - 5) el | Which of the following assumptions is not true about sequencing problems? (2) The processing times on different machines are independent of the order in which the jobs are processed on them. (b) First all of the jobs are completed on the first machine and then their processing starts on the second machine. (0) Ajob once started would be performed to the point of completion uninterrupted. (d) A machine cannot process more than one job at a time. In terms of Johnson's Rule, the optimal sequence is obtained using following rule _. (a) Job () precedes job (j + 1) if min (A, Bj.1) < min (A, B) (b) Job () precedes job (j + 1) if min (Ay Bx) > min (Aj.1, B) (©) Job Gj) succeeds jobs (j + 1) if min (A; Bj.1) < min (Aj.1, 8) (d) None of the above Which of the following is not correct about n jobs - 2 machines (A and B) sequencing problem in which the order of processing is AB___. (a) If minimum time of a job is on machine A, then do that job first. () If minimum time of a job is on machine B, then do that job in the end. (©) If there is a tie in the minimum times for two jobs say job 4 on machine B and job 6 ‘on machine A, then the jobs can be scheduled as (4, 6) in the beginning or (6, 4) in the end. (d) If there is a tie in the timings of two or more jobs on machine B, then do them in any order at the end. 3 Scanned with CamScanne ae — 4. LE Four jobs are to be processed on two machines A and B in the processing times of the jobs are known to be :I (10, 8), 1 (6, 17), 1m (ag, 14) The optimal sequence would be __.. (@) IV, mT (b) IV, 11 () LMLVv (d) IV, 1, M1 Which of the following conditions should be satisfied in order that an p problem may be solved using extended Johnson's Rule. (1) min A, 2 max B, (2) min A < max B, (3) min C; 2 max B, (b) (1) and (3) (a) only (2) (d) (2) or (3) or Both (© (2) or (3) of Both Consider the following conditions for solving sequencing prot processing of n jobs on k machines in the order A, B, C, ... , K. (2) min A\2 (max B, max C, ..., max Ji) (2) min K, < (max B, max C, ..., max Ji) which is the condition for applying (extended) Johnson's Rule? (2) Condition (1) only (b) Condition (2) only (©) Conditions (1) and (2) both (d) Conditions either (1) or (2) ANSWERS 30 [4@ [5@ [6@]- Chapter 5: Probability (Unit - 3) Mutually exclusive events are the events where _. (2) each event is independent of the others (b) if one event takes place the others are ruled out (Q) can happen mutually (d) none of the above The sample space consists of ___. (2) all possible simple events (b) all the exhaustive events (©) events such that at least one of them must happen at a time (d) all of the above For mutually exclusive events, A,B andC__. . (2) P(AUB) = P(A) + P(B) - P(ANB) (b) P(AUB) = P(A) + P(B) + (©) P(AUB) = P(A) + P(B) (d) P(A/B) = P(A) + P(B) For dependent events A andB___. (a) P(ArB) = P(A) - P(B/A) (©) P(ANB) = PIA) + P(B) [2 [2@ (b) P(AMB) = P(A) - P(B) (d)_P(AUB) = P(A) + P(B) scanned wi Scanned with CamScanne

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy