OR UNIT WISE 2 MARKS QUESTION-ANSWERS

UNIT V
GAME THEORY
1. What is a strategy?
It is the course of action by a player in a game

2. What are the two types of strategy employed in a game?/Differentiate

between pure strategy and mixed strategy.
There are two types of strategies. They are pure strategy and mixed strategy.
Pure strategy: If a player selects a particular strategy with a probability of 1, then
that is pure strategy i.e., the player is selecting that particular strategy alone
ignoring strategies. If player A follows a pure strategy then only one of the pi = 1,
and the remaining pi values will be equal to 0. p1 = 0, p2 = 1, p3 = 0. The sum pi +
pi + pi = 1.
Mixed Strategy: If a player follows more than one strategy then it is said to
follow a mixed strategy. The probability of selection of individual strategy ≤ 1.
and their sum =1. If the game has no saddle point, the it is said to have mixed
strategy.
3. What is a payoff matrix in a game theory?
Each combination of the alternatives of Players A and B is associated with an
outcome , aij. If aij is positive, it means gain to Player A and a loss of player B. If
aij is negative, it represents a loss to Player A and a gain to player B.

Refer notes by me for the payoff matrix.

4. Differentiate between maximin and minimax principle.

Maximin Principle: It maximizes the minimum guaranteed gains of player A. The
maximum of these minimum gains is known as the maximin value and the
corresponding alternative is called as maximin strategy.
Minimax Principle: It minimizes the maximum losses. The minimum of these
maximum losses is known as the minimax value and the corresponding alternative
is called as minimax strategy.

5. Define saddle point.

In a game if the maximin value is equal to the minimax value, then the game is
said to have a saddle point. If the game has has a saddle point, then each player
has a pure strategy.

6. What is the value of the game?

If the game has a saddle point, then the value of the cell at the saddle point it is
called the value of the game.

7. What is two person zero sum game?

In a game with 2 players, if the gain of one player is equal to the loss of another
player, then it is called two person zero sum game.
8. What are the various methods of solution to mixed strategy?
 Algebraic method
 Arithmetic method
 Graphical method
 Linear programming method.

9. What do you mean by dominance property?

It is possible to reduce the size of the pay off matrix by eliminating redundant
rows or columns.
If a game has such redundant rows or columns, those rows or columns are
dominated by some other rows or columns, respectively. Such property is known
as dominance property.

10. Explain the dominance property for rows.

a. In the payoff matrix of player A, if all the entries in a row (X) are ≥ the
corresponding entries of another row [Y], then row [Y]then row [Y] is
dominated by row [X]. Then, row [Y] is eliminated.
b. In the payoff matrix of player A, if each of the average of the entries of any
two rows [X and Y] ≥ corresponding entry of a third row [Z].Then row [Z] is
dominated by row[ X and Y]. Then row [Z] is eliminated.

11. Explain the dominance property for columns.

a. In the payoff matrix of player A, if all the entries in a column (X) ≤ the
corresponding entries of another column [Y], then column [Y] is dominated by
row [X]. Then, row [Y] is eliminated.
b. In the payoff matrix of player A, if each of the average of the entries of any two
columns [X and Y] ≤ corresponding entry of a third column [Z].Then column [Z].
is dominated by row[ X and Y]. Then column [Z] is eliminated.

DYNAMIC PROGRAMMING

1. What do you mean by dynamic programming?

It is a special kind of optimization technique which subdivides an original
problem into as many number of subproblems as the variables, solves each
subproblem individually and then obtains the solution of the original problem by
integrating the solutions of the subproblems. It is a systematic, complete
enumeration technique.

2. What is a stage in dynamic programming?

Each subproblem of the original problem is known as a stage i.

3. What do you mean by an alternative in dynamic programming?

In a given stage I, there may be more than one choice of carrying out a task. Each
choice is known as an alternative.

4. What is a state variable in a dynamic programming?

A possible value of a resource within its permitted range at a given stage i is
known as state variable.
 5. What is the use of recursive function in dynamic programming?
It is a function which links the measure of performance of interest of the current
state with the cumulative measure of performance of the previous
stages/succeeding stages as a function of the state variable of the current stage is
known as the recursive function of the current stage.
5. What are the two types of recursive function in dynamic programming?
Backward recursive function: Here , the computation begins from the last
stage/subproblem, and this stage is numbered as stage 1, while the first
subproblem as the last stage. Since the recursion proceeds in a backward direction,
this type of recursive function is known as backward recursive function.
Forward recursive function: While defining the stages of the original problem,
the first subproblem will be numbered as stage 1 and last subproblem will be
numbered as the last stage. Then, the recursive function will be defined as per this
assumption. This type of recursive function is known as forward recursive
function.
6. List the applications of dynamic programming.
 Capital budgeting problem
 Reliability Improvement problem
 Stage-coach problem
 Cargo-loading problem
 Linear programming problem
7. What is a capital budegeting problem?
It is a problem in which a given amount of capital is allocated to a set of plants by
selecting the most promising alternative for each selected plant such that the total
revenue of the organization is maximized.
8. What is reliability improvement problem?
Generally electronic equipments are made up of several components in series of
parallel. Assuming that the components are connected in series, if there is a failure
of a component in the series, it will make the equipment inoperative. The
reliability of the equipment can be increased by providing optimal number of
standby units toeach of the components in the series such that the total reliability
of the equipment is maximized subject to a cost constraint.
9. What is a stage-coach problem?
It is a shortest-path problem in which the objective is to find the shortest distance
and the corresponding path from a given source node to a given destination node
in a given distance network.
10. What is cargo loading problem?
It is an optimization problem in which a logistic company is left with the option of
loading a desirable combination of items in a cargo subject to its weight or volume or
both constraints. In this process, the return to the company is to be maximized.
UNIT III
TRANSPORTATION PROBLEM
1. Define a transportation problem.
It is a special kind of linear programming problem in which goods are transported
from a set of sources to a set of destinations subject to the supply and demand of
the source and destination, respectively, such that the total cost of transportation is
minimized.

2. Write down the mathematical model for transportation problem.

 Let m be the number of sources, n be the number of destinations, ai be the supply
a the source i, bj be the demand at the destination j. cij be the cost of transportation
per unit from source i to destination j. Let Xij be the number of units to be
transported from the source i to the destination j.
Refer notes by me for the mathematical model .

3. Differentiate between balanced transportation problem and unbalanced

transportation problem.
Balanced transportation problem: If the sum of the supplies of all the sources
is equal to the sum of the demands of all the destinations, then the problem is
termed as balanced transportation problem.
i.e., Σai = Σbj for all for all i = 1 to m and j = 1 to n..

Unbalanced Transportation Problem: If the sum of the supplies of all the

sources is not equal to the sum of the demands of all the destinations, then the
problem is termed as unbalanced transportation problem.
i.e., Σai ≠ Σbj for all for all i = 1 to m and j = 1 to n..
4. Mention the various methods of finding initial basic feasible solution to a
transportation problem.
 Northwest Corner method
 Least cost cell method
 Vogel’s approximation method[Penalty method]
5.How can you resolve an unbalanced transportation problem?
An unbalanced transportation problem can be resolved by adding a dummy row
with zeroes is added as an additional source, if the total demand is greater than the
total source.
A dummy column with zeroes is added as an additional destination , if the total source
is greater than the total demand.
6. What do you mean by degeneracy in a transportaition problem? How can you
resolve it?
Degeneracy occurs when the number of basic cells are less than (m+n-1), where m is
the number of sources and n is the number of destinations.
Degeneracy can occur either during initial solution or during iterative process. For
both the cases, allocate an infinitesimally small quantity ε , to any independent
unoccupied cell and proceed as if it is a basic cell.
7. Write the method of forming a loop in transportation problem.
Identify the non-basic cell, which has the maximum positive penalty and term that as
the new basic cell. Starting from the new cell, draw a closed loop consisting of only
horizontal and vertical lines passing through some basic cells.[The change of direction
of the loop should be with 90o only at some basic cell].Starting from the new basic
cell, alternatively assign positive and negative signs at the corners of the closed loop.
8. Mention some of the special cases of transportation problem.
 Unbalanced TP
 Alternative optimal solution
 Prohibited transportation routes
 Maximization transportation problem.
9. What do you mean by Prohibited transportation problem.
Situation may arise such as road hazards such as snow, flood etc traffic regulations,
when it is not possible to transport goods from certain sources to certain destinations.
Such problems can be handled by assigning a very large cost say M to that route/cell.
10.How do you solve a maximization transportation problem?
The maximization problem, can be solved by converting it into minimization problem
by subtracting all the cell values from the largest cost/profit in the matrix.
11.What is a transshipment problem?
The transshipment problem is an extension of the transportation problem. Instead of
direct shipments to destinations, the commodity can be transported to a particular
destination through one or more intermediate or trans-shipment point. Each of these
points, in turn, supply to other points.Thus, when the shipments pass from source to
source, we have a transshipment problem
Refer notes by me for the diagram.
UNIT 1V
ASSIGNMENT PROBLEM

1. What is an assignment problem?

It is a special kind of transportation problem in which each source should have the
capacity to fulfill the demand of any of the desitnations. Let m be number of jobs
as well as the number of operators and cij be the processing time of the job i if it is
assigned to the operator j. Here, the objective is to assign the jobs to the operators
such that the total processing time is minimized.

2. Differentiate between transportation problem and an assignment problem.

TRANSPORTATION PROBLEM ASSIGNMENT PROBLEM
1. It is a special kind of linear 1. It is a special kind of transportation
programming problem in which goods are problem in which each source should
transported from a set of sources to a set have the capacity to fulfill the demand of
of destinations subject to the supply and any of the desitnations
demand of the source and destination,
respectively, such that the total cost of
transportation is minimized
2. The cost matrix is not necessarily a 2. The cost matrix must be a square
square matrix matrix.[rows = columns]
3. Xi j , the quantity is transported from ith 3. Xi j ,the jth job is assigned to the ith
origin to jth destination.Hence it can take person and can take either the value of
only positive values and satisfied the rim one or zero.
requirements.
4. The capacity and the requirement value 4.The capacity and the requirements
is equal to ai and bj for ith source and jth value is exactly one
destination
5. The TP is unbalanced if the total 5. The AP is unbalanced if the cost
supplyexceeds or is lesser than total matrix is not a square matrix.
demand

3. What is a traveling salesman problem?

 Usually, a salesman markets his product in different cities. He starts his journey
from head quarters and travels to each city and again comes back to his Head
Quarters.

4. Mention the two types of traveling salesman problem.

 Symmetric traveling salesman problem
 Assymetric traveling salesman problem.

5. Differentiate between symmetric traveling salesman problem and

asymmetric traveling salesman problem.
A traveling salesman problem is symmetric if the distance or cost of passing from
any point i to any other point j is the same as the distance from j to i. Otherwise
the problem is asymmetric.

6. Write down the basic conditions or route conditions for solving a

traveling salesman problem.
 The salesman should go through every city exactly once, except the head
quarters[starting city]
 The salesman starts from one city[HQ] and comes back to that city[HQ]
 Obviously moving from any city to the same city directly is not allowed.[i.e.,
no assignments should be made going on the diagonal line].

7.What is the objective of traveling salesman problem?

Salesman has to visit various cities no visiting twice to the same place and return
to the starting place by spending minimum transportation cost.

8. What are the basic assumptions of the Assignment problem?

 The number of assignees and the number of tasks are the same.
 Each assignee is to be assigned to exactly one task.
 Each task is to be performed by exactly one assignee
 There is a cost cij associated with assignee [i = 1,2,3….n] performing task
j [j =12……n]
 The objective is to determine how all n assignments should be made to
minimize the total cost.

9. Differentiate between balanced and unbalanced assignment problem.

The assignment problem is said to be balanced if the number of rows[jobs] is
equal to the number of columns[operators].
If the number of rows[jobs] is not equal to the number of columns[operators], then it
is an unbalanced assignment problem. It can be resolved by adding dummy rows or
columns as needed depending upon the given cost matrix, to make it a square matrix.

10.How can you solve a maximization assignment problem?

The maximization problem, can be solved by converting it into minimization problem
by subtracting all the cell values from the largest cost/profit in the matrix.
 INTEGER PROGRAMMING

1. Define integer programming.

It is an LPP problem in which some or all of the variables in the optimal solution
are restricted to assume non-negative integer values.
2. What are the two types of integer programming?
Pure integer programming and mixed integer programming are the two types of
integer programming.
The maximization problem, can be solved by converting it into minimization
problem by subtracting all the cell values from the largest cost/profit in the matrix.
3. Differentiate between pure and mixed integer programming.
Pure Integer Programing: In a LPP, if all the variables in the optimal solution are
restricted to asuume non-negative integer values, then it is called Pure integer
programming problem
Mixed integer Programming: If only some of the variables in the optimal solution
are restrict ted to assume non-negative integer values, while the remaining are free
to take any non-negative values, then it is mixed IPP.
4. What is a 0-1 integer programming?
If all the variables in the optimum solution are allowed to take values either 0 or 1
as ‘do or do not’ type decisions, then the problem is called the 0-1 programming
or standard discrete programming problem.
5. What are the applications of Integer Programming?
 IPP occur quite frequently in business and industry.
 All transportation problem, assignment and traveling salesman
problems are IPP, since the decision variables are either 0 or 1.
 All sequencing and routing decisions are IPP as it requires the integer
values of the decision variables.
 Capital budgeting and production scheduling problems are IPP.
 All allocation problems involving the allocation of goods, men,
machines, give rise to IPP
6. Mention the methods of solving an IPP.
 Cutting method
 Search method
7. Briefly explain what is cutting plane method in IPP.
It is a systematic procedure for solving pure and mixed IPP. It consists in first
solving the IPP as ordinary LPP by ignoring the integrality restriction and then
introducing additional constraints one after the other to cut certain part of the
solution until an integral solution is obtained.
8. What is branching in branch and bound technique?
If the solution to the LPP contains non-integer values for some or all decision
variables, then the solution the solution space is reduced by introducing
constraints with respect to any one of those decision variables.
9. When is a problem said to be fathomed in integer programming ?
A problem is said to be fathomed if any one of the following three conditions is
true.
 The values of the decision variables of the problem are integer
 The upper bound of the problem which has non-integer values for its
decision variables is not greater than the current best lower bound
 The problem has infeasible solution.