1.

Choose the odd one out about LPP

(a) all constraints must be in linear rela onships

(b) objec ve func on must be linear

(c) all the constraints and decision variables must be of either ‘≤’ or ‘≥

(d) all decision variables must be non-nega ve

2. LPP is not associated with---------------------

(a) propor onality (b) uncertainity (c) addi vity (d) divisibility

3. Choose the correct op on about LPP

(a) linear programming takes into considera on the effect of me an
(b) an LPP can have only two decision variables
(c) decision variables in an LPP may be more or less than the number
(d) linear programming deals with problems involving only a single

4. Opera on Research is the study of ______

(a) management techniques (b) design techniques
(c) op misa on techniques (d) linear techniques

5. Opera on Research is the applica on of --------------------- methods to arrive at the op mal solu ons to the
problems.
(a) economical (b) ar s c (c) both a and b (d) scien fic

6. In finance management, Opera on research techniques are used especially in ____

(a) debit policies (b) product analysis (c) credit risks (d) design control

7. A constraint in an LPP restricts

(a) value of objec ve func on (b) value of a decision variable
(c) use of available resource (d) uncertainty of op mum value

8. --------------------------- is the objec ve func on in LPP

(a) a constraint for available resource (b) a set of non-nega vity condi ons
(c) an objec ve for research and development of a company (d) a linear func on is an op miz on problem

9. Non-nega vity condi on is an important component of LPP, because…………….

(a) variables are interrelated in terms of limited resource
(b) value of variables make sense and correspond to real world proble
(c) value of variables should remain under the control of decision-ma
(d) variables are related in terms of limited resources

10. Minimiza on of objec ve func on in LPP means

(a) least value chosen among the allowable decisions
(b) greatest value chosen among the allowable decisions
(c) both (a) and (b)
(d) value chosen among the allowable decisions

11. ------------------- is the subdivision of models in Opera on research

(a) analy c models (b) iconic models (c) mathema cal models (d) sta c models

12. The model which uses one set of proper es to represent another set of proper es is ______
(a) iconic (b) analogue (c) symbolic (d) sta c
27. The objec ve func on and constraints must be _______
(a) linear equa ons (b) inequali es (c) dynamic (d) both (a) and (b)

28. The general linear programming problem is in standard form, if

(a) the constraints are strict equa ons (b) the constraints are inequali es of ‘≤’ type
(c) the constraints are inequali es of ‘≥’ type (d) the decision variables are unrestricted in sign

29. ------------------ is not correct about LPP related to graphical method and op mum solu on
(a) graphical method of linear programming is not useful when there
(b) solu on of a maximiza on LPP when permi ed to be infinitely lar `
(c) op mum solu on to an LPP always lies at least on the two ver ce
(d) it is possible for the objec ve func on value of an LPP to be the sa

30. -------------------------- is the correct statement

(a) slack variables are used to convert the inequali es of the type ‘≤’
(b) surplus variables are used to convert the inequali es of the type ‘
(c) an LPP with all its constraints are of the type ‘≥’ is said to be in sta
(d) an LPP with all its constraints are of the type ‘≤’ is said to be in can

31. In general mathema cal model formula on of L.P.P ie.) is called _____
(a) constraints (b) structural constraints (c) nega vity restric on (d) linear equa on

32. Determining the solu on by analy c or itera ve or Monto-carlo method depends upon the structure of ______
model
(a) sta c (b) mathema cal (c) analy c (d) iconic

33. ------------------------- is the role of O.R in Engineering

(a) produc on control (b) rental outlets (c) flow analysis (d) product selec on

34. Given a system of m simultaneous linear equa ons in n unknowns (m < n), the number of basic variables will be
(a) m (b) n (c) n -m (d) n + m

35. Choose the correct statement

(a) the general LPP with m constraints in n unknowns (m < n) gives ba
(b) a basic solu on that sa sfies all the constraints and non- nega ve
(c) a basic solu on in which at least one basic variable vanishes is zer
(d) the basic feasible solu on which maximizes or minimizes the obje

36. --------------------------- is not correct in simplex method

(a) simplex method is an itera ve process which involves the subs tu
(b) solu on by Simplex method requires that an LPP should have at le
(c) for solving an LPP by Simplex method, it is essen al that all variab
(d) simplex method requires that all the constraints should be first co

37. LPP deals with determining the _________ alloca ons.

(a) op mal (b) maximum (c) func on (d) programming

38. The variables whose value determine the solu on of a problem are called ______
(a) decision variable (b) random variable (c) op mal variable (d) none of the above

39. The term ________ means that all the variables occuring in the objec ve func on.
(a) constraints ` (b) variables (c) linear (d) maximum
55. The problems are ______ if the no.of.variables and constraints are quite change.
(a) easy (b) not complex (c) complex (d) none of the above

56. Any solu on to a LPP which sa sfy the nega ve restric ons of the LPP is called its ____
(a) op mal solu on (b) infeasible solu on (c) feasible solu on (d) none of the above

57. Any feasible solu on which op mises the objec ve func on of the LPP is called ______
(a) op mal solu on (b) infeasible solu on (c) feasible solu on (d) none of the above

58. ------------------------ statement is not correct

(a) associated with every LPP, there is always another LPP which is ba
b) given LPP is called the primal problem while the associated LPP is
(c) it is always necessary to convert the inequality constraints into eq
(d) the dual of dual is primal

59. The dual of the primal maximiza on LPP having m constraints and a non-nega ve variables should
(a) be a minimiza on LPP (b) have a n constraints and m non-nega ve variables
(c) both (a) and (b) (d) have a m constraints and n non-nega ve variables

60, The right hand side constant of a constraint in a primal problem appears in the corresponding dual as
(a) a coefficient in the objec ve func on (b) a right hand side constant of a constraint in a dual problem
(c) an input-output coefficient (d) none of the above

61. The right hand side constant in the ith constraint in primal must be equal to the objec ve coefficient for _______.
(a) jth primal variable (b) ith dual variable (c) ith primal variable (d) jth dual variable

62. In primal dual solu ons, the dual problem solu on can be obtained by solving other problems classified as
______.
(a) unrestricted problem (b) original problem (c) dual problem (d) restricted problem

63. In the dual simplex method, the basic variables are allowed to take on _______ , but we keep the reduced costs
non-nega ve,
(a) posi ve values (b) nega ve values (c) original values (d) shadow prices

64. If dual has an unbounded solu on, primal has

(a) an unbounded solu on (b) an infeasible solu on (c) a feasible solu on (d) none of the above

65. For any primal and its dual

(a) op mum value of the objec ve func on is same
(b) both primal and dual cannot be feasible
(c) primal will have an op mum solu on if and only if dual does too
(d) op mum value of the objec ve func on is not same

66. Dual simplex method is applicable to these LPP’s that start with
(a) an infeasible solu on (b) an infeasible but op mum solu on
(c) a feasible solu on (d) a feasible and op mum solu on

67. The variables which are viola ng the third requirment of non-nega vity constraints in dual problems are
_______.
(a) posi ve constants (b) non-posi ve variables (c) unrestricted variables (d) both b and c

68. The variable in dual problem which can assume the posi ve values,nega ve values or zero values is classified as
______.
81. The transporta on problem has a solu on iff the problem has a _______
(a) balanced (b) unbalanced (c) either a or b (d) op mal

82. MODI can be expressed as ________

(a) magnified distribu on (b) modified distribu on (c) modified distrac on (d) magnified distrac on

83. In a transporta on problem, if the number of non-nega ve alloca ons is less than m+n-1 then it is called _______
(a) degenerate (b) non-degenerate (c) balance (d) feasible

84. The total revenue is calculated by _________.

(a) (price)(quan ty sold) (b) price/quan ty sold (c) price+quan ty sold (d) price -quan ty sold

85. Expressing a primal solu on in terms of a dual solu on can be done with:
(a) the KKT primal and dual feasibility condi ons
(b) the KKT complementary slackness condi on, under strong duality
(c) the KKT sta onarity condi on always.
(d) the KKT sta onarity condi on, under strong duality

86. If Σai = Σbj, then the transporta on problem is said to be _______

(a) balanced (b) unbalanced (c) feasible (d) infeasible

87. If Σai ¹ Σbj, then the transporta on problem is said to be _______

(a) balanced (b) unbalanced (c) feasible (d) infeasible

88. In transporta on problem, the coefficient of all xij in the constraints are _______
(a) different (b) unity (c) zero (d) none

89. The transporta on problem is a special classes of

(a) LPP (b) NLPP (c) assignment problem (d) simplex method

90. Row wise and column wise difference between two minimum costs is calculated under _______ method.
(a) VAM (b) NWC (c) Least cost (d) MODI

91. The number of non-basic variables in the balanced transporta on problem with 3 rows and 5 colums is
(a) 7 (b) 8 (c) 15 (d) 9

92. The slack variable is mostly used in the equa on which is of ___________.
(a) less than or equal to constraints (b) greater than or equal to constrain
(c) equal to constraints (d) slack constraint

93. The objec ve is to determine the amount to be shi ed from each source to each des na on such that the total
transporta on cost is _______
(a) Maximium (b) Minimum (c) Equal (d) Zero

94. _______________ deals with the transporta on of a commodity from m sources to n des na ons
(a) assignable (b) transporta on cost (c) transporta on (d) transporta on model

95. The ___________ model also be modified to account for mul ple commodi es.
(a) Assignable (b) Transporta on cost (c) Transporta on (d) Transporta on model

96. The unit __________ cost of commodity from each source to each des na on .
(a) assignable (b) transporta on cost (c) transporta on (d) transporta on model
113. A feasible solu on to a (m*n) transporta on problem that contains no more than m+n-1 non nega ve alloca on
is called _____________ to the (a) non degenerate basic feasible solu on Ques on
(c) degenerate basic (b) feasible solu on (d) basic feasible solu on

114.Iden fy the cell with smallest cost and allocate xij is equal to
(a) mini (b) max (c) mini (d) max

115. A basic feasible solu on to a (m*n) transporta on problem is said to be a ___________ solu on if it contains
exactly m+n-1 non nega ve allocate
(a) non degenerate basic feasible solu on (c) degenerate basic A (b) feasible solu on (d) basic feasible solu on

116. The penalty in VAM represents difference between ____________ cost of respec ve row or coloumn
(a) two largest (b) smallest two (c) largest and smallest (d) none of the above

117. The __________ method's solu on for transporta on problem is some mes an op mal solu on itself
(a) north west corner rule (b) vogel's approxima on method (c) least cost method (d) row minima

118. A basic feasible solu on that contains less than m+n-1 non- nega ve alloca ons is said to be a
_______________ feasible solu on
(a) degenerate basic (b) op mal (c) non degenerate basic (d) basic feasible

119. A feasible solu on is said to be an ______________ solu on if it minimizes the total transporta on cost.
(a) degenerate basic (b) op mal (c) non degenerate basic (d) basic feasible

120. The number of basic variables in an mxn balanced transporta on problem is atmost _______
(a) m+n+1 (b) m+n-1 (c) m-n-1 (d) m-n+1

121. The number of non-basic variables in an mxn balanced transporta on problem is atleast _______
(a) mn-(m+n-1) (b) mn+(m-n-1) (c) mn+1 (d) m+n-1

122. Find the star ng solu on of the following transporta on mode using Vogel's approxima on method
(a) Rs.40 (b) Rs.30 (c) Rs.20 (d) Rs.10

123. Find the transporta on problem

(a) Rs.800 (b) Rs.796 (c) Rs.600 (d) Rs.300

124. Find the ini al transporta on cost for transporta on problem using VAM
(a) RS.20 (b) Rs.29 (c) Rs.30 (d) Rs.40

125. The first assignment is made in the cell occupying the ___________ corner of the transporta on table
(a) north-west (b) least cost (c) MODI (d) VAM

126. If all dij >0 then the solu on under the test is ____________
(a) op mal &unique (b) degenerate (c) not op mal (d) basic feasible

127. If atleast one dij<0 then the solu on is __________

(a) op mal &unique (b) not op mal (c) basic feasible (d) ini al basic feasible

128If all _________ with atleast one dij =0 then the solu on under the test is op mal and an alterna ve
op mal solu on exist
(a) dij>0 (b) dij<0 (c) dij=0 (d) dij!=0
(d) subtrac ng all the elements in a row from the highest element o

144.For a salesman, who has to visit a ci es, following are the ways of his tour plan
(a) n (b) n ! (c) (n + 1) ! (d) (n - i) !

145.If the number of rows is __________ to the number of column in the cost matrix of the given assignment
problem is
said to be unbalanced (a) equal (b) not equal (c) greater than (d) less than

146.First convert the unbalanced assignment problem in to a balanced one by adding _______ with zero
costeleinthecost matrix depending
(a) dummy rows (b) dummy column (c) dummy rows or dummy column (d) dummy source

147.Find the op mum assignment cost a) Rs.50 (b) Rs.100 (c) Rs.150 (d) Rs.500

148.In assignment problem the value of decision variable xij is _________

(a) no restric on (b) two or one (c) one or zero (d) restric on

149.If number of sources is not equal to number of des na on in assignment problem then it is called ______
(a) Unbalanced (b) symmetric (c) an symmetric (d) balanced

150.An assignment problem is considered as a par cular case of a transporta on problem because _________
(a) it involves minimizing transprta on costs
(b) it has a different objec ve func on
(c) each resource is assigned to mul ple task
(d) each resource is assigned to exactly one task and each task is as

151.The purpose of a dummy row or column in an assignment problem is to ___________

(a) obtain balance with in total ac vi es & total resources (b) prevent a solu on from becoming degenerate
(c) prevent a means of represen ng a dummy problem (d) obtain unbalance

152.The assignment technique assumes that the problem is free from prac cal ________ and any tasks could be
assigned to any facility (a) no restric on (b) restric ons (c) two or one (d) one or
zero

153.The method used for solving an assignment problem is called ____________

(a) reduced matrix method (b) MODI method (c) Hungarian method (d) op mal

154.The ________ method used to obtain op mum solu on of travelling salesman problem
(a) simplex Ques on (c) dominance (b) hungarian (d) graphical

155.The hungarian method for solving an assignment problem can also be used to solve ________
(a) a transporta on problem (b) a travelling salesman problem (c) both a & b (d) simpex problem

156.Hungarian method subtract the _______ cost element of each row from all the elements in the row of the given
cost matrix.see that each row
(a) smallest cost (c) assignment cost (b) transporta on cost (d) maximum cost

157.Examine the rows successively un l a row with exactly one ________ zero is found
(a) marked (b) unmarked (c) encircled (d) circled

158.Apply op mal test if each row and each column contain exactly one __________ zero then the current
assignment is op mal (a) marked (b) unmarked (c) encircled (d) circled
175.A __________ is very similar to the assignment problem with addi onal constraints
(a) travelling salesman problem (b) transporta on problem
(c) maximiza on problem (d) minimiza on problem

176.The travelling salesman problem if not , making adjustments in assignments to sa sfy the condi on with
minimum increasing ________ cost
(a) transporta on (b) assignable (c) total (d) maximum

177.Assignment problem demand at any des na on will be _________

(a) zero (b) one (c) posi ve (d) nega ve

178.The units available at each source and units demanded at each des na on are equal to _______
(a) zero (b) one (c) two (d) three

179.Any feasible solu on which op mizes the objec ve func on of the L.P.P. Is called _____
(a) solu on (b) feasible solu on (c) op mal solu on (d) slack

180.-----------------------is the correct charac s cs of canonical form (a) maximize profit (b) minimize cost
(c) frac onal coefficients (d) nega ve variables

181.The maximiza on of the func on f(x) is ______ to the maximiza on of the nega ve expressions of the func on
(a) greater (b) lesser (c) equivalent (d) different

182.An unequality in one directrion can be converted into an inequality in the opposite direc on by mul plying both
sides by (a) 1 (b) -1 (c) 0 (d) 2

183.Slack surplus variables are introduced in the constraints, they should also appear in the objec ve func on with
____ coefficient (a) one (b) two (c) zero (d) three

184.The most commonly used method for loca ng the op mal vertex in the
(a) simplex method (b) Big-M method (c) two phase method (d) least cost method

185.A basic solu on is said to be a _____ if none of the basic variable is zero
(a) non-degenerate basic solu on (b) degenerate basic solu on
(c) basic feasible solu on (d) non- basic variable

186.There exists only ____ of basic feasible solu on to a L.P.P.

(a) zero (b) finite number (c) infinite number (d) one

187.The leaving variable row is called the _____ (a) pivot row (b) base row (c) leaving row (d) exi ng row
A feasible solu on in linear programming is one that
(a) maximizes the objec ve func on (b) sa sfies all the constraints
(c) has all posi ve variables (d) has all nega ve variables

188.Big M Method is used to solve constraints with (a) equal to type (b) greater than equal to
(c) both (d) less than equal to type

189.The Method used to solve L.P.P. Without the use of the ar ficial variable is called
(a) simplex method (b) Big-M method (c) dual simplex method (d) graphical method
PART C

1. i) Define non-degenerate basic feasible solution, degenerate basic and optimal solution. ii) Explain
Standard transportation table.
2. i) Give the mathematical formulation of transportation problem. ii) Describe the standard transportation
table .

3. Find the initial basic feasible solution of the following transportation problem by least cost method.

4. Solve the transportation problem using the matrix minima method.

3. Find the non degenerate basic feasible solution for the following transportation problem using
vogel's approximation method

4.Solve the transportation problem using optimum solution

5.Solve the transportation problem unit transportation cost demands and supplies as given below

6. Solve the transportation problem unit transportation cost in rupees demands and supplies as given below:
PART C
1. List out the guideliness to construct the dual problem
2.i) What is Duality? ii) Write the general formulation of symmetric form.