Objectives

UNIT IV: JOB SEQUENCING

1) The time required to perform each job on each machine is known as
--------------
a) Idle Time
b) Elapsed Time
c) Processing time
d) In time
2) The time interval between starting first job & completion of last job is
known as --------------
a) Idle Time
b) Elapsed Time
c) Processing time
d) In time
3) The time during which a machine remains vacant is known
as-----------------
a) Idle Time
b) Elapsed Time
c) Processing time
d) In time
4) ---------------helps in determining optimal sequence between jobs.
a) Assignment problem
b) Transportation problem
c) Job-sequencing problem
d) Game theory
5) To perform J1,J2,J3 & J4 on machine A ,6,10,8,4 hrs are required. To
perform J1,J2,J3 & J4 on machine B ,5, 8, 12, 7 hrs are required .Then
optimal sequencing is
a) J2,J4,J3,J1
b) J1,J2,J3,J4
c) J3,J1,J2,J4
d) J4,J2,J1,J3
e) J4, J3, J2, J1
6) To perform J1,J2,J3 & J4 on machine A ,10,12,8,15 hrs are required. To
perform J1,J2,J3 & J4 on machine B ,10,11,7,17 hrs are required .Then
optimal sequencing is
a) J2,J3,J1,J4
b) J1,J4,J3,J2
c) J1,J4,J2,J3
d) J3,J1,J2,J4
7) To perform J1,J2,J3 & J4 on machine A ,5,4,15,8 hrs are required. To
perform J1,J2,J3 & J4 on machine B ,9,10,7,5 hrs are required .Then
optimal sequencing is
a) J1,J3,J2,J4
b) J3,J1,J4,J2
c) J4,J2,J1,J3
d) J2,J1,J3,J4
8) Three machines A,B & C are merged into two machines if
a) Amin>=Bmax
b) Amax<=Cmin
c) Amin<=Bmax
d) Amin<=Cmin
9) J1,J2,J3 & J4 are performed on three machines which requires 5,13,6,7
hrs on M1, 3,5,4,2 hrs on M2 & 7,9,5 6 Hrs on M3.Then optimal sequencing
is
a) J2,J4,J1,J3
b) J4,J1,J3,J2
c) J1,J2,J3,J4
d) J3,J4,J2,J1
10) J1,J2,J3 & J4 are performed on three machines which requires 4,2,6,3
hrs on M1, 2,3,5,4 hrs on M2 & 5,7,6,8 Hrs on M3.Then optimal sequencing
is
e) J1,J4,J1,J3
f) J4,J2,J3,J1
g) J3,J2,J4,J1
h) J2,J1,J4,J3
11) Minimum elapsed time is 26 hrs. Duration required to complete 4 jobs on
machine A is 5,8,4,3 & on machine B is 2,10,5,6 Then idle time of machine
A is------------hrs
a) 1
b) 4
c) 3
d) 2
e) 6
12) Minimum elapsed time is 26 hrs. Duration required to complete 4 jobs on
machine A is 5,8,4,3 & on machine B is 2,10,5,6 Then idle time of machine
B is------hrs.
a) 1
b) 4
c) 3
d) 2
13) The objective of job sequencing is
a) To reduce minimum elapsed time
b) To increase processing time on each machine
c) To increase total duration required to complete all jobs
d) To assign a job to machine on one to one machine
 UNIT I: LINEAR PROGRAMMING PROBLEM
FORMULATION OF GIVEN PROBLEM  AS  LPP:
1) In LPP, the objective function & constraints are expressed as ------------- 
a) Linear Function 
b) Quadratic Function 
c) Cubic Function 
d) Non-linear Function 
2) Which of the following statement is incorrect in case of formulation of
LPP? 
a) Objective function is linear function 
b) Number of decision variables depends upon number of products to be
manufactured 
c) Number of constraints depends upon number of resources utilized for
production 
d) Each decision variable is always positive 
3) In LPP, ---------------- represent mathematical equation of the limitations
imposed by the problem. 
a) Objective function 
b) Each Constraint 
c) Decision variables 
d) Non-negative variables 
4) In LPP, the function which minimizes total cost or maximizes total profit is
known as ---------- 
a) Constraint 
b) Objective function 
c) Non-linear function 
d) Linear function 
5) In LPP ,each decision variable must be ----------------- 
a) Non-negative 

b) Non-positive 
c) positive 
d) Negative 
6) If company manufactures three products which are processed on two
machinery then LPP has 
a) 2 decision variables & 3 constraints 
b) 3 decision variables & 2 constraints 
c) 2 decision variables & 2 constraints 
d) 3 decision variables & 3 constraints 
7) If company manufactures two products & utilizes three types of raw
material then LPP has 
a) 2 decision variables & 3 constraints 
b) 3 decision variables & 2 constraints 
c) 2 decision variables & 2 constraints 
d) 3 decision variables & 3 constraints 
8) Which of the following statement is incorrect in case of linear programming
problem? 
a) It maximizes total revenue 
b) It minimizes total production cost 
c) It determines how to use limited resources 
d) Each decision variable is always positive 
9) Which of the following statement is incorrect in case of objective function 
a) It maximizes total profit 
b) It minimizes total production cost 
c) It is a non-linear function 
d) It is a linear function 
10) In LPP ,each decision variable must be ----------------- 
a) >0 
b) >=0 
c) <0 
d) <=0 
11) If company earns profit of Rs.120 per unit by selling x product, Rs.80 per
unit by selling y product
& Rs.100 per unit by selling z product then objective function is -------- 
a) Max Z= 120x+80y 
b) Min Z= 80y+120z 
c) Max Z= 120x+80y+100z 
d) Min Z= 120x+80y+100z 
12) Production cost required for per unit of x1 is Rs.55,per unit of x2 is Rs.60
& per unit of x3 is Rs.30
then objective function is ------------ 
a) Max Z= 50x1+30x3 
b) Min Z= 60x2+30x3 
c) Max Z= 55x1+60x3+30x3 
d) Min Z= 55x1+60x3+30x3 
13) Product x requires 5 kg of R1 & 2 kg of R2.Product y requires 1 kg of R1 & 3
kg of R2.Company
utilizes at least 15 kg of R1 & at most 12kg of R2 .Then LPP has set of
constraint ----- 
a) 5x+y≤15,2x+3y≤12 
b) 5x+y≥15,2x+3y≤12 
c) 5x+y≥15,2x+3y≥12 
d) 5x+y≤15,2x+3y≥12 
14) Product x requires 6 kg of R1 & 3 kg of R2.Product y requires 4 kg of R1 &
2 kg of R2.Company
utilizes maximum 20 kg of R1 & 30 kg of R2 .Then LPP has set of constraint
---- 
a) 6x+4y≤20,3x+2y≤30 
b) 6x+3y≤20,4x+2y≤30 
c) 6x+4y≤20,3x+2y≥30 
d) 6x+4y≥20,4x+2y≤30 
15) Product x requires 6 kg of R1 & 3 kg of R2.Product y requires 4 kg of R1 &
2 kg of R2.Company
utilizes minimum 20 kg of R1 & maximum 30 kg R2 .Then LPP has set of
constraint ----- 
a) 6x+4y≤20,3x+2y≤30 
b) 6x+3y≤20,4x+2y≤30 
c) 6x+3y≥20,4x+2y≤30 
d) 6x+4y≥20,3x+2y≤30 
16) Product x requires 2 kg of R1 & 5 kg of R2.Product y requires 3 kg of R1 &
4 kg of R2.Company
must utilize at least 22 kg of R1 & 16 kg R2 per week. Then LPP has set of
constraint ----- 
a) 2x+5y≥22,3x+4y≥16
b) 2x+5y≤22,3x+4y≤16 
c) 2x+3y≥22,5x+4y≥16 
d) 2x+3y≤22,5x+4y≤16 

GRAPHICAL METHOD TO SOLVE  LPP:

1) Graphical Method is applicable to solve LPP which consists of ----------- 
a) Two constraints & two decision variables 
b) Two constraints and any number of decision variables 
c) Any number of constraints and any number of decision variables 
d) Any number of constraints and two decision variables 
2) Graphically each constraint & objective function represent 
a) Circle 
b) Parabola 
c) Ellipse 
d) Straight line 
3) In LPP if constraints are in the form of ≥ then we shade the region ------- 
a) Below the line 
b) Above the line 
c) Below the line in first quadrant 
d) Above the line in first quadrant 
4) In LPP if constraints are in the form of ≤ then we shade the region ------- 
a) Below the line 
b) Above the line 
c) Below the line in first quadrant 
d) Above the line in first quadrant
1) The feasible region is the region bounded by ------------ 
a) Decision Variables 
b) Constraints 
c) Objective function
d) Decision Variables & constraints 
2) In LPP ,Max Z= 3x+2y subject to 2x+y≤ 50, 5x+2y≤ 120,x≥0, y≥0 , which of the
points are feasible? 
a) (50 ,0)
b) (30,20) 
c) (0,90) 
d) (10,30) 
3) The objective function of LPP is Max Z= 3x+2y with optimal solution
x=20,y=30 then maximum profit earned by company is ----- 
a) 10 
b) 50 
c) 120 
d) 75 
4) The objective function of LPP is Min Z= 4x+5y with optimal solution
x=10,y=20 then minimum production cost required by company is ----- 
a) 140 
b) 200 
c) 250 
d) 300 
5) The feasible solution of LPP exists in--------------- 
a) Only in first quadrant 
b) In first & second quadrant 
c) In first & third quadrant 
d) In first & 4th quadrant 
6) The feasible region of LPP has 4 corner points 0(0,0),A(1,1),B(0,1),C(1,0) .If
objective function is Max Z= 2x+4y then there is ---------- 
a) Unique solution at A 
b) Unique solution at B 
c) Unique solution at C 
d) Alternate solution at A & C 
7) The feasible region of LPP has 3 corner points A(0,10),B(8,6),C(12,0).If
objective function is Min Z= x+5y then there is ---------- 
a) Unique solution at A 
b) Unique solution at B 
c) Unique solution at C 
d) Alternate solution at A & C 
8) The feasible region of LPP has 3 corner points A(0,3),B(1,2),C(0,2).If
objective function is Max Z= 2x+2y then there is ---------- 
a) Unique solution at A 
b) Unique solution at B 
c) Unique solution at C 
d) Alternate solution at A & B 
9) Which of the following is not a vertex of the feasible region formed by
constraints x+2y≤ 4 , 2x+2y≤ 6 ,x≥0, y≥0 
a) (2,1) 
b) (0,2) 
c) (4,5) 
d) (3,0) 
10) The slope of the line 3x+5y=20 is----------------- 
a) -5/3 
b) -3/5 
c) 5/3 
d) 3/5 
11)The slope of the line 7x-3y=20 is----------------- 
a) 7/3 
b) -7/3 
c) 3/7 
d) -3/7 
12) Infeasibility of LPP means there is ---------------------- 
a) unbounded region 
b) no common region 
c) no common region in the first quadrant 
d) one constraint is ≤ & other is ≥ 
13) If slope of objective function coincides with slope of constraint then LPP
has---------------- 
a) Many solution 
b) Unbounded Solution 
c) No solution 
d) Unique Solution 
14) If each constraint is of type ≥ & objective function is max z then given
LPP has ----------------------- 
a) Many solutions 
b) Unbounded solution 
c) Unique solution 
d) No solution 
15) Redundant constraint means -------------------------- 
a) the constraint after removing from graph does not affect optimal
solution 
b) the constraint which is parallel to objective function 
c) the constraint which don’t form feasible region 
d) the constraint which leads unbounded region 
16) Unbounded solution of LPP occurs if -------------------------- 
a) Each constraint is of type ≥ 
b) Each constraint is of type ≤ 
c) Each constraint is of type ≥ & objective function is max z 
d) Each constraint is of type ≥ & objective function is min z 
17) Unbounded region with objective function max z has ---------------
a) Infeasible solution 
b) Unique solution 
c) Unbounded solution 
d) Multiple solution 
18) If there is no common region in first quadrant then LPP has
a) unique solution
b) no solution
c) multiple solutions
d) unbounded solution
19) Given LPP has multiple solutions if
a) there is no common region
b) there is unbounded region
c) bounded region
d) bounded region & slope of objective function coincides with slope of
constraint
20) If max z=4x+3y subject to 3x+4y<=12,4x+3y<=12, x+y<=6 then
a) there is no redundancy
b) 3x+4y<=12 is redundant constraint
c) 4x+3y<=12 is redundant constraint
d) x+y<=6 is redundant constraint
21) If max z=4x+3y subject to 3x+4y<=24,4x+3y<=24, x+y<=4 then
a) there is no redundancy
b) 3x+4y<=24 is redundant constraint
c) 4x+3y<=24 is redundant constraint
d) x+y<=4 is redundant constraint
22) If max z=x+3y subject to 2x+5y>=10,5x+2y>=10, x+y>=6 then
a) 2x+5y>=10 is redundant constraint
b) 5x+2y>=10 is redundant constraint
c) there is no redundancy
d) x+y>=6 is redundant constraint
23) If max z=x+3y subject to 2x+5y>=10,5x+2y>=10, x+y>=4 then
a) 2x+5y>=10 is redundant constraint
b) 5x+2y>=10 is redundant constraint
c) there is no redundancy
d) x+y>=4 is redundant constraint

28) The LPP Max Z=3x+5y subject to 2x+3 y ≤6 , 5x+4y ≥ 20 , x, y ≥ 0 has ----
a) Many solution 
b) Unbounded Solution 
c) No solution 
d) Unique Solution 
29) The LPP Max Z=2x+3y subject to x+2y ≥ 4, 5x+3y ≥15, x,y ≥ 0 has ------
a) Many solution 
b) Unbounded Solution 
c) No solution 
d) Unique Solution 
30) The LPP Max Z=x+y subject to 2x+2y ≤ 4, 3x+y ≤ 3, x,y ≥ 0 has ----------- 
a) Many solution 
b) Unbounded Solution 
c) No solution 
d) Unique Solution 
31) The LPP Min Z=4x+3y subject to 3x+2y ≤ 6, 4x+y ≥ 4 , x,y ≥ 0 has --------
a) Many solution 
b) Unbounded Solution 
c) No solution
d) Unique Solution 
 UNIT 2: TRANSPORTATION PROBLEM
BALANCED & UNBALANCED TRANSPORTATION PROBLEM
1. Given  transportation  problem  is said to be balanced  if ----------------------
a) total supply = total demand
b) number of origins  = number of destinations 
c) total demand <total supply
d) total supply<total demand
2. Given  transportation  problem  is said to be unbalanced  if
----------------------
total supply ≠ total demand
number of origins  < number of destinations 
Number of rows ≠number of columns
number of origins  > number of destinations 
3. If in transportation problem, total supply < total demand
then------------------------
Problem is unbalanced
Problem is maximization
Problem has  degenerate solution
Problem has  non-degenerate  solution
4. If in transportation problem , total supply = total demand
then------------------------
Problem is maximization
Problem is balanced
Problem has  degenerate solution
Problem has  non-degenerate  solution
5. In given transportation problem , we add dummy origin if
---------------------
Number of origins < number of destinations
Total supply < total demand
Number of origins > number of destinations
Total supply > total demand
6. In given transportation problem , we add dummy destination
if------------------------
Number of origins < number of destinations
Total supply < total demand
Number of origins > number of destinations
Total supply > total demand
7. The purpose of a dummy origin  or dummy destination  is to
--------------------------
Convert  degenerate solution into non-degenerate
Convert unbalanced Assignment problem into balance form
Convert unbalanced transportation problem into balance form
To find optimal solution
8. The cost associated with dummy origin  or destination  in transportation
problem  is always-------------
Very large positive cost
Very large negative  cost
Zero
Any value
1. If  ai represent supply from origin Oi & bj represent demand from
destination Dj & if ∑ai <  ∑bj then we add --------------------
a) Dummy Demand
b) Dummy Supply
c) Dummy origin
d) Dummy destination
2. If  ai represent supply from origin Oi & bj represent demand from
destination Dj & if ∑ai >  ∑bj then we add --------------------
a) Dummy Demand
b) Dummy Supply
c) Dummy origin
d) Dummy destination
3. If  in given transportation problem, total supply=200,total demand=200 then
problem is said to be ---------
a) Balanced Transportation problem 
b) Unbalanced Transportation problem 
c) Balanced Assignment problem 
d) Unbalanced Assignment problem 
4. If  in given transportation problem, total supply =200, total demand=300
then problem is said to be ---------
a) Balanced Transportation problem 
b) Unbalanced Transportation problem 
c) Balanced Assignment problem 
d) Unbalanced Assignment problem

 
5. If  in given transportation problem, total supply =400, total demand=300
then we add --------
a) Dummy Demand
b) Dummy Supply
c) Dummy origin
d) Dummy destination
6. If  in given transportation problem, total supply =250, total demand=300
then we add --------------
a) Dummy Demand
b) Dummy Supply
c) Dummy origin
d) Dummy destination
7. 130,70 & 50 are production capacities of production plants P1,P2 & P3
respectively . 45, 55 & 50 are quantities demanded at warehouses W1, W2 &
W3 respectively .Then we add 
a) Dummy Demand
b) Dummy Supply
c) Dummy Production plant
d) Dummy warehouse
8. 30,70 & 50 are production capacities of production plants P1,P2 & P3
respectively . 45, 75 & 50 are quantities demanded at warehouses W1, W2 &
W3 respectively .Then we add 
a) Dummy Demand
b) Dummy Supply
c) Dummy Production plant
d) Dummy warehouse
9. 130,75 & 50 are production capacities of production plants P1,P2 & P3
respectively . 35, 55 & 50 are quantities demanded at warehouses W1, W2 &
W3 respectively .Then we add 
a) Dummy Production plant with cost zero & production capacity of 115 units
b) Dummy warehouse with cost zero & demand of  115 units
c) Dummy Production plant with random cost & production capacity of 115
units
d) Dummy warehouse with cost random zero & demand of  115 units
10. 110,75 & 50 are production capacities of production plants P1,P2 & P3
respectively . 135, 55 & 150 are quantities demanded at warehouses W1, W2
& W3 respectively .Then we add 
a) Dummy Production plant with cost zero & production capacity of 105 units
b) Dummy warehouse with cost zero & demand of  105 units
c) Dummy Production plant with random cost & production capacity of 105
units
d) Dummy warehouse with cost random zero & demand of  105 units

METHODS TO FIND IBFS

11. ------------------------ is applicable to find  IBFS in transportation problem.
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) All of the above
12. ------------------------ is the method which does not take into account cost of
transportation  to find IBFS of  transportation problem.
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Row minima method
13. ------------------------ is the method in which we select  the place for
transportation which is at  extreme left corner of the given problem 
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Column minima method
14. One disadvantage of using North- West Corner rule method to find IBFS  of
given transportation problem is that ----------------------
a) It can not be used when profits are given
b) it does not take into account cost of transportation
c) it leads to degenerate solution 
d) it does not give optimal solution
15. --------------- is the method in which we select  the place for transportation
which has minimum cost 
a) Vogel’s approximation method
b) North west corner rule method
c) Matrix minima  Method
d) Hungarian method
16. One advantage of using Matrix Minima  method to find IBFS  of given
transportation problem is that --
a) it is easier than VAM
b) it does take into account cost while  transporting the commodities
c) it does take into account minimum cost while  transporting the
commodities
d) it gives optimal solution
17. In   transportation problem ,------------------------ is the method of
penalties 
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Modified distribution method
18. ------------------------ is applicable to find better IBFS in transportation
problem.
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Hungarian method
19. In which  of the following method difference between two minimum costs
for each row & column is calculated while finding IBFS
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Modified distribution method
20. To convert profit matrix into regret matrix we subtract-----------
a) Each profit from minimum profit
b) Each profit from maximum profit
c) Maximum  profit from each profit
d) Minimum profit  from each profit
21. Cost from P1 to W1 is Rs.10, P1 to W2 is Rs.12, P1 to W3 is Rs.8, P1 to W4 is
15 then to find IBFS by north-west corner rule method we select the place
from ---------------for transportation
a) P1 to W1
b) P1 to W2
c) P1 to W3
d) P1 to W4
22. Cost from P1 to W1 is Rs.10, P1 to W2 is Rs.12, P1 to W3 is Rs.8, P1 to W4 is
15 then to find IBFS by matrix minima method we select the place from
---------------for transportation
a) P1 to W1
b) P1 to W2
c) P1 to W3
d) P1 to W4
23. Cost from P1 to W1 is Rs.10, P1 to W2 is Rs.12, P1 to W3 is Rs.8, P1 to W4 is
15 then penalty corresponding production plant P1 is
a) 2
b) 3
c) 4
d) 5
24. Company has decided to transport 50 commodities from P1 to W1 with cost
per unit Rs.10, 40 commodities from P1 to W3 with cost per unit Rs.12, 25
commodities from P2 to W2 with cost per unit Rs.5, 55 commodities from P3
to W2 with cost per unit Rs.7 & 30 commodities from P3 to W3 with cost per
unit Rs.12.Then total transportation cost is
a) Rs.2,850
b) Rs.2,580
c) Rs.1,850
d) Rs.1,580

PROHIBITED TRANSPORTATION PROBLEM

25. If there is restriction to transport the commodities from one place to
another place then such problem is said to be ------------------
a) Balanced transportation problem
b) Unbalanced transportation problem
c) Prohibited transportation problem
d) Maximization problem
26. A  prohibited transportation problem can be handled by assigning a value
which is -------------------
a) A very large negative  number
b) Zero
c) any  number
d) A very large positive number
35. If in transportation problem , total supply < total demand with profit  per
unit given then-------
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
1. If in transportation problem , total supply > total demand with cost per unit
given then----------
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
2. If in transportation problem, total supply = total demand with profit per
unit given then--------
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
3. If in transportation problem, total supply = total demand with cost per unit
given then----------
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
4. Cost per unit from P1 to W1is 4, P1 to W2 is Rs6 ,P1 to W3  is Rs10, P1 to
W4  is 8 Then to find IBFS by NWCRM we select the place-----------
a) P1 to W1
b) P1 to W2
c) P1to W3
d) P1to W4
5. Cost per unit from P1 to W1is 4, P1 to W2 is Rs 2 ,P1 to W3  is Rs10, P1 to
W4  is 8 Then to find IBFS by Least cost Method  we select the
place-------------
a) P1 to W1
b) P1 to W2
c) P1to W3
d) P1to W4
 6. Cost per unit from P1 to W1is 4, P1 to W2 is Rs 16 ,P1 to W3  is Rs10, P1 to
W4  is 8 Then penalty of P1 is
a) 2
b) 4
c) 3
d) 5
ASSIGNMENT  PROBLEM
BALANCED & UNBALANCED ASSIGNMENT  PROBLEM 
1. ------------------------ is applicable to solve given Assignment  problem.
a) Vogel’s approximation method
b) North west corner rule method
c) Least cost Method
d) Hungarian Method
2. Given  assignment problem  is said to be balanced if ----------------------
a) number of jobs  < number of workers
b) number of origins  > number of destinations 
c) number of jobs = number of workers
d) number of origins  = number of destinations
3. Given  assignment problem  is said to be unbalanced if ----------------------
a) number of jobs  < number of workers
b) number of origins  > number of destinations 
c) number of jobs = number of workers
d) number of origins  = number of destinations
4. If in an assignment  problem , number of rows ≠number of columns
then------------------------
a) Problem is unbalanced
b) Problem is maximization
c) Problem has  degenerate solution
d) Problem has  non-degenerate  solution
5. If in an assignment  problem , number of jobs =  number of machines 
then------------------------
a) Problem is maximization
b) Problem is balanced
c) Problem has  degenerate solution
d) Problem has  non-degenerate  solution
6. In given assignment  problem , we add dummy row  if --------------------------
a) Number of rows < number of columns
b) Number of rows > number of columns
c) Total supply < total demand
d) Total demand < total supply 
7. In given assignment  problem , we add dummy column  if
--------------------------
a) Number of rows < number of columns
b) Number of rows > number of columns
c) Total supply < total demand
d) Total demand < total supply 
8. If in assignment problem , total number of jobs < total number of workers
with duration required to perform each job by each worker is given then---
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
9. If in assignment problem , total number of jobs = total number of workers
with duration required to perform each job by each worker is given then---
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
10. If in assignment problem , number of territories > number of salesmen
with sale is given then---
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
11. If in assignment problem , number of territories = number of salesmen with
sale is given then---
a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
Problem is unbalanced & maximization

12. If in assignment problem , total number of jobs = total number of

workers with duration required to perform each job by each worker is given
then---
 a) Problem is balanced & maximization
b) Problem is unbalanced & minimization 
c) Problem is balanced & minimization
d) Problem is unbalanced & maximization 
13. The cost associated with dummy row or column in A.P. is always-------------
a) Very large positive cost
b) Very large negative  cost
c) Zero
d) Any value
14. To convert profit matrix into regret matrix we subtract-----------
a) Each profit from minimum profit
b) Each profit from maximum profit
c) Maximum  profit from each profit
d) Minimum profit  from each profit

OPTIMAL SOLUTION
15. An optimal solution of an Assignment problem can be obtained only if
---------------
a) Each row & column has only one zero
b) Each row & column has at least  one zero
c) Each row & column has at most  one zero
d) There is no zero
16. The solution of a assignment  problem is said to be optimal  if -------------
a) Number of lines  < number of jobs
b) Number of lines  > number of jobs
c) Number of lines  = number of jobs
d) There is no restriction on number of lines
17. If in assignment problem Number of lines  = number of jobs
then------------------------
a) Problem is unbalanced
b) Problem is maximization
c) Problem has  degenerate solution
d) Problem has  optimal  solution

18. If in assignment problem Number of lines  < number of jobs

then------------------------
a) Problem is unbalanced
b) Problem is maximization
 c) Problem has  degenerate solution
d) Problem has  non-degenerate solution

PROHIBITED ASSIGNMENT  PROBLEM

19. If there is restriction to assign a job to worker  then such problem is said
to be ------------------
a) Balanced assignment  problem
b) Unbalanced assignment  problem
c) Prohibited assignment  problem
d) Maximization problem
20. A  prohibited assignment  problem can be handled by assigning a value
which is -------------------
a) A very large negative  number
b) Zero
c) any  number
d) A very large positive number