Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
MCA-IV (NEW)
MC0079
COMPUTER BASED OPTIMIZATION METHODS
1-MARK
1. The scientific method in OR study generally involves ------------ phases
a) Two
b) Three
c) Four
d) Many
ns. b
!. "## with Three decision variables -----be solved graphically
a) can
b) cannot
c) usually
d) none of the above
ns. b
$. %ame of the second algorithm is
a) &ranch and bound
b) "and and dig
c) 'omory
d) %one of the above
ns. a
(. The given )## is modified by inserting a new constrained called
a) *econdary constraint
b) 'omory constrained
c) "and constrained
d) &oth a) and b)
ns. d
+. )n the ,ueuing theory there is ----- ma-imi.ation and minimi.ation of an ob/ective function.
a)
b) %o
c) &oth
d) %one
ns. b
0. The average rate at which customers arrive called
a) rrival pattern
b) *ervice facility
c) &oth a) and b)
d) %one of the above
ns. a
1. fter adding the secondary constraints the problem is then solved by
a) *imple- method
b) 2ual simple- method
c) ll of the above
d) %one of the above
ns. b
3. n4 means
a) %umber of e,uation
b) %umber of variables
c) ll of the above
d) %one of the above
ns. b
5. *ometimes the problem may be infeasible indicating that no --------- of the problem e-ists
a) *olution
b) Feasible
c) Feasible solution
d) ll of the above
ns. c
16. The ob/ective function may have to be ma-imi.ed when it e-pressed the --------
a) #rofit
b) 7ontribution
c) 7ost
d) &oth a) and b)
ns. d
11. To each of the constraint e,uations add a new variable called an
a) *lac8 variable
b) *urplus variable
c) rtificial variable
d) %one of the above
ns. c
1!. The variables which have assigned value .ero initially are called
a) *lac8 variable
b) *urplus variable
c) rtificial variable
d) %on basic variables
ns. d
1$. )f one or more values of the basic variables are also .ero valued then solution of the system
is said to
a) %on degenerate
b) 2egenerate
c) 9ariable
d) %on variable
ns. b
1(. )n modern warfare the defense operations are carried out by ------ components
a) !
b) (
c) +
d) $
ns. d
1+. The first and the most important re,uirement is that the
a) 2efine alternatives
b) 7hoose alternatives
c) Root problem should be identified and understood
d) ll of the above
ns. c
. 10. common method for testing the validity of a model is to compare its performance with
some ------ data available for the actual system
a) #resent
b) Future
c) #ast
d) ll of the above
ns. c
. 11. )n linear programming problems may have
a) uni,ue optimal solution
b) Many number of optimal solution
c) n unbounded solution
d) %o solution
e) ll of the above
ns. e
.13. The transportation problem studies
a) Ma-imi.ation of profit
b) Minimi.ation of cost
c) &oth a) and b)
d) %one of the above
ns. b
. 15. The 9ogels ppropriation method ta8es into account not only the least cost 7i/ but also
the cost that
a) :ust less 7i/
b) :ust e-ceeds 7i/
c) &oth a) and b)
d) %one of the above
ns. b
!6. row or column difference indicates the
a) Ma-imum unit penalty
b) Minimum unit penalty
c) &oth a) and b)
d) %one of the above
ns. b
!1. )f the %o. of persons is the same as the no. of /obs; the assignment problem is said to be
a) %one
b) &alanced
c) Right
d) <rong
ns. b
!!. )n assignment problem Minimi.e the
a) 7ost
b) Time
c) &oth a) and b)
d) %one of the above
ns. c
!$. ssignment model is mostly used in
a) )ndustry
b) 'ovt.
c) #lanning
d) %one of the above
ns. c
!(. loop is the se,uence of cells in the -------
a) Transportation table
b) Feasible solution
c) Optimum solution
d) ll of the above
ns. a
!+. )n the transportation problem it is assumed that the total supply and the total demand are ---
a) =,ual
b) %on e,ual
c) &oth a) and b)
d) %one of the above
ns. a
!0. The random number could be selected by any ---------
a) #ast data
b) )mputing sub/ective values
c) #resent data
d) Random process
ns. d
!1. =-pand #=RT
a) #ro/ect evaluation and review techni,ue
b) #lanning evaluation and review techni,ue
c) #ro/ect evaluation and revise techni,ue
d) %one of the above
ns. a
!3. The game theory prominence only after
a) 15!3
b) 15((
c) 15!!
d) 15(6
ns. b
!5. 7ompetitive situations occur when two or more parties ---------- operate
a) Trading
b) )nterest
c) 7onflicting interest
d) %one of the above
ns. c
$6. )n a competitive game the no. of players is
a) Three
b) Four
c) Two
d) Finite
ns. d
$1. )n a typical pricing problem; the management cannot ris8 changing the price of the product
without evaluating the various ----
a) *amples
b) #ast data
c) lternatives
d) ll of the above
ns. c
$!. *imulation is often referred to as -------
a) #eter berg analysis
b) Monte 7arlo analysis
c) &oth a) and b)
d) %one of the above
ns. b
$$. The transportation algorithm is the -------method
a) Mathematical
b) *cientific
c) *imple-
d) 'raphical
ns. c
$(. ny feasible solution satisfying
a) m>n>1
b) m>n-1
c) m-n-1
d) none of the above
ns. b
$+. The e-pression may be traced by
a) 9on %eumann
b) ?lan
c) &oth a) and b)
d) %one of the above
ns. c
$0. The game is said to be played when each player adopts one of his
a) 7ourse of action
b) Move
c) &oth a) and b)
d) %one of the above
ns. c
$1. game in which two players participate is called
a) n @ person game
b) two- person game
c) all of the above
d) none of the above
ns. b
$3. =-pand 7#M
a) 7ritical #ro/ect method
b) 7ritical path method
c) 7rucial path method
d) %one of the above
ns. b
$5. )n #=RT @ 7#M there are basic phase is
a) One
b) Two
c) Three
d) Four
ns. c
(6. &asic disadvantages of the mid s,uare method is
a) 'enerated numbers may start cycling after a short set of random no. is obtained
b) 'enerated numbers may start circling after a long set of random no. is obtained
c) &oth a) and b)
d) %one of the above
ns. a
2-MARKS
(1. ll constraints are e,uations e-cept for the -------------- condition which remain
ine,ualities----------- only.
a) %on negativity; AB; 6)
b) %egativity; AB; 6)
c) %on negativity; AC;6)
d) ll of the above
ns. a
(!. ll variables are -------
a) %egative.
b) %on negative
c) &oth a) and b)
d) %one of the above
ns. b
($. The output or the -------------- sub/ect to the set of ------
a) #roblem; constraints
b) Ob/ective function; constraints
c) 7onstraints; ob/ective function
d) %one of the above
ns. b
((. )n ai/ iD---------
a) 1;!;$
b) 1;!;$------n
c) 1;!;$;-------m
d) ll of the above
ns. c
(+. 7haracteristics of canonical forms is
a) ll decision variables are non negative
b) ll constraints are of C type
c) The ob/ective function is of the ma-imi.ation type
d) ll of the above
ns. d
(0. The ultimate goal of all such decision is to either ma-imi.e the --------- and minimi.e the
---------------
a) &enefit; effort re,uired
b) =ffort; benefit
c) #rofit; benefit
d) %one of the above
ns. a
(1. )n defense operations there is a necessity to ----------- the activities of various components
which gives ma-imum benefit to the organi.ation as a ---------
a) Ordinate; whole
b) Ordinate; separate division
c) 7o- ordinate; whole
d) 7o @ ordinate; separate division
ns. c
(3. The cost 7i/ transporting one units of product from the )th ------- to the /th -------- is given
for each ) and /
a) 2estination; source
b) 2estination; ob/ective
c) *ource; destination
d) %one of the above
ns. c
(5. n analysis of the process is made usually with the help of a flow diagram and an attempt
is made to identify the points which restrict service or the characteristics which indicate scope
for improvement this study is done in a
a) =-ploration of the various alternatives
b) #reliminary study
c) &oth a) and b)
d) %one of the above
ns. b
+6. "ast step of a typical investigation of a ,ueuing system is
a) 7ollection of data
b) 2ata analysis
c) =valuation of alternatives
d) )mplementation
ns. d
+1. Method of choosing a customer for service from amongst those waiting for service is called
a) rrival pattern
b) *ervice facility
c) Eueue discipline
d) ll of the above
ns. c
+!. The transportation algorithm is the simple- method speciali.ed to the formal of table it
involves
a) Finding an integral basic feasible solution
b) Testing the solution for optimality
c) )mproving the solution; when it is not optimal
d) ll of the above
ns. d
+$. The business environment is always ------and any decision useful at one time many not be
so ------- some time later
a) 7hanging; good
b) *ame; good
c) 7hanging; bad
d) %one of the above
ns. a
+(. n e,uation can be replaced by two ine,ualities in opposite direction for e-ample !-1>$-!
D + can be written as
a) !-1>$-! C+ and !-1>$-! B+
b) !-1>$-! C-+ and !-1>$-! B-+
c) !-1>$-! C+ and -!-1-$-! B-+
d) &oth a) and c)
ns. d
++. The remaining characteristics are achieved by using the elementary transformation
introduced with the ---------
a) Mathematical form
b) Feasible solution
c) 7anonical form
d) ll of the above
ns. c
+0. 9on %eumann and ?lan; who in the late 15(64s found a problem in the field of ------
a) %uclear physics
b) #hysics
c) &usiness
d) %one of the above
ns. a
+1. )n 13(00 FevenG digits signify a Head and the FoddG digits represent a tail. Then H and T in
it is
a) $;!
b) (;1
c) 1;(
d) !;$
ns. b
+3. The growing comple-ities of today4s pro/ects had demanded more ------ and ------- with the
ob/ective of optimi.ing the efficiency of e-ecuting the pro/ect.
a) #lanning; budget
b) *ystematic; planning
c) *ystematic; more effective planning techni,ues
d) ll of the above
ns. c
+5. =fficiency in #ro/ect planning means
a) ?tmost reduction in the time re,uired to complete the pro/ect
b) =conomic feasibility of using available resources
c) &oth a) and b)
d) %one of the above
ns. c
06. The approach adopted for solving a problem in gambling can be e-tended decision ma8ing
in business where --------- is a common feature.
a) *toc8
b) 7apital
c) Ris8
d) *tationary
ns. c
4-MARKS
01. *tate True of False for characteristics of a competitive game
1. The no. of players is infinite
!. =ach player has finite no. of courses of moves
$. the game is said to be played when each player plan a strategy
(. The game is played once
+. The corresponding combination of courses of action leads to a transaction to each
player
0. The payment is called gain
) 1-T;!-T;$-T;(-T;+-T;0-F
&) 1-T;!-F;$-T;(-F;+-T;0-F
7) 1-F;!-F;$-T;(-T;+-T;0-F
2) 1-F;!-T;$-F;(-F;+-T;0-T
ns. d
0!. Match the following
S! - 1
1. #ro/ect planning
!. scheduling
$. pro/ect control
S! - 2
a) 2eveloping a networ8 diagram showing the se,uential inter relationships between the
various activities
b) Refers to revaluating actual progress against the plan
c) =stimating the durations of activities; ta8ing into considerations the resources re,uired
for these e-ecution in most economic manner.
) 1-a;!-c;$-b
&) 1-a;!-b;$-c
7) 1-c;!-a$-b
2) %one of the above
ns. a
0$. For solving games if we use dominance then the procedure is
a) )n the pay off matri- if each pay off in the rth row is grater then the corresponding pay
off in the sth row; r dominates s. nd so s is deleted
b) )n the pay off matri-; if each pay off in the pth column is less than the corresponding
pay off in the ,th column; &p dominates &,; and so &, is deleted
c) The above steps are repeated in succession until the saddle point is reached and hence
the solutions is written down
) 1;!;$
&) !;1;$
7) $;1;!
2) %one of the above
ns. a
0(. Match the following
S! - 1
!. #=RT
$. 7#M
S! - 2
a) 2eveloped in connection with R and 2
b) 7ope with the uncertainties
c) 2eveloped in connection with construction pro/ect
d) =vent oriented networ8
e) 7onsisted of routine tas8s
f) ?sed for pro/ects involving activities of non repetitive nature
g) ?sed for pro/ects involving activates of repetitive nature
) 1-a;c;d;f; !-b;e;g
&) 1-a;b;e;f; !-c;d;g
7) 1-a;b;d;f; !-c;e;g
2) 1-b;d;f; !-a;c;e;g
ns. c
0+. )t is essential for the -------- to have a understanding of the -------- so that he will consider
the right ------ and formulate the correct model
a) =-ecutive; process; alternatives
b) *taff; process; alternatives
c) =-ecutive; Model; alternatives
d) %one of the above
ns. a
00. *hips arrive at a port at a rate of one in every $ hours; with a negative e-ponential
distribution of interracial times. The time a ship occupies a berth for unloading and loading
has a negative e-ponential distribution with an average of 1! hours. )f the average delay of
ships waiting for berths is to be 8ept below 0 hours; how many berths should there be at the
port.
a) 1
b) +
c) 3
d) 0
ns. d
01. )n case only some of the variables are restricted to ta8e integral value and rest An @ 8)
variables are free to ta8e any non negative values; then the problem is 8nows as
a) ll integer programming problem
b) #ure integer programming problem
c) Mi-ed integer programming problem
d) )nteger programming problem
ns. c
"#$ Four /obs are to be done on four different machines. The cost is in A Rs.) of producing )th
on the :th machine is given below
Machines
M1 M! M$ M(
:1 1+ 11 1$ 1+
:! 11 1! 1! 1$
:$ 1( 1+ 16 1(
:( 10 1$ 11 11
. )n the above ,uestion :ob 1 to machine
a) 1
b) !
c) $
d) (
ns. a
&. :ob ( to machine
a) 1
b) !
c) $
d) (
ns. c
05. *tate true or false for the basic techni,ues for getting the optimum solution
1. 2etermining the net evaluations for the non @ basic variables
!. 2etermining the entering variable
$. 2etermining the leaving variable
(. 7omputing a better basic feasible solution
+. Repeating steps A1) to A() until an optimum solution has been obtained
a. ll are true
b. ll are false
c. Only 1!$( are true
d. Only 1$(+ are true
ns.
16. ?se simple- method to solve the "##
Ma-imi.e I D !-1 > ( J! > J$ > J(
*ub/ect to -1 > $ J! > J( C (
!-1 > -! > C $
J! > (J$ > J( C $
-1 ;J! ; J$ ; J( B 6
)s all elements of the last row are -------
a) %egative
b) %on @ negative
c) Multipliers
d) %one of the above
ns. b
11. Ob/ective of operation research is to provide a --------- basis to the ----------- for solving the
problems involving the interaction of various ------------ of organi.ation; by employing a team
of -------------- from different disciplines; all wor8ing -------- for finding a solution which is the
best in the interest of the organi.ation as a whole.
a) *cientific; businessman; components; scientists; together
b) *cientific; 2ecision -ma8er; components; scientists; separately
c) *cientific; 2ecision -ma8er; components; scientists; together
d) *cientific; 2ecision -ma8er; components; staff; together
ns. c
1!. *tate True or False for OR method in the can be applied in the field of
1. #roduction
!. )nventory control
$. Mar8eting
(. #urchasing
+. Transportation
0. 7ompetitive strategies
) ll are True
&) ll are False
7) Only 1;!;$;(;+ are true
2) Only !;$;(;+;0 are true
ns. a
1$. Match the following
SET -1
1. #lanning
!. griculture
$. Hospital
(. Transportation
+. Research and 2evelopment
SET -2
a) There is need for increase output. &ut this cannot be done arbitrarily.
b) #roduct )ntroduction; #lanning etc.
c) <aiting problems
d) )t is necessary for every government
e) To regulate the arrivals and processing time
) 1-c;!-b;$-a;(-e;+-d
&) 1-d;!-a;$-c;(-e;+-b
7) 1-b;!-a;$-d;(-c;+-e
2) 1-c;!-a;$-b;(-d;+-e
ns. b
1(. 2ecision ma8ing can be considered as a general systematic process that steps is
a) 2efine the problem; select the alternative; determine the model to be used; evaluate the
alternative; choose the one
b) 2efine the problem; select the alternative; determine the model to be used; choose the
one; define the alternative
c) *elect the problem; define the alternative; determine the model to be used; evaluate the
alternative; choose the one
d) ny of the above
ns. a
1+. Match the following
SET -1
1. 2ecision variables
!. Ob/ective function
$. 7onstraints
SET -2
b) The un8nowns to be determined from the solution of model
c) This defines the measure of effectiveness of the system as a mathematical function of
its decision variables
d) To account for the physical limitations
) 1-c;!-b;$-a
&) 1-b;!-a;$-c
7) 1-a;!-b;$-c
2) %one of the above
ns. c