SUBJECT CODE/NAME: MG1402 - OPERATIONS RESEARCH

YEAR/SEM: IV/VII BRANCH: EEE

UNIT-I
LINEAR PROGRAMMING(LP)
PART-A 2 MARKS

UNIT I LINEAR PROGRAMMING (LP)

Basic concepts and scope of OR – Phases of OR – Formulation of LP Problems

– Limitations of
LP – Solutions to LPP – Graphical Solution – Standard LP form and its Basic
solutions – The
simplex algorithm – Artificial Variable Technique – Big-M method, Two-phase
method – Variants of the Simplex Method – Degeneracy, unbounded solution,
infeasible solution – Application for business and Industrial problems

1. What is operations research?

Operation Research:

1. OR is an aid for the executive in making decisions by providing him with the quantitative
information, based on the scientific method analysis.
2. OR is the art of giving bad answers to problems, to which, otherwise worse answers are given.
3.OR is the art of wining wars without actually fighting them.
4.OR is the application of scientific methods by interdisciplinary teams to problems involving the
control of organised (man-machine) systems so as to provide solutions which best serve the
purpose of the organisation as a whole.

The objective of OR is to provide a scientific basis to the managers of an organization for

solving problems involving interaction of the components of the system, by employing a system
approach by a team of scientists drawn from different disciplines, for finding a solution which is in
the best interest of the organization as a whole.

2. What are the phases of an operations research study?

The various phases of operation research (or)

The steps involved in the solution of OR Problem.

Operation research is based on scientific methodology which proceeds as:

1. Formulating the problem.
2 Constructing a model to represent the system under study
3. Deriving a solution from the model.
4. Testing the model and the solution derivq4 from it.
5. Establishing controls over the solution.
6. Putting the solution to work i.e. implementation.
(i) Assignment of job to machine
(ii) Product mix
(iii) Advertising media selection
(iv) Transportation.

2. Dynamic programming
(i) Capital budgeting
(ii) Employment smoothening
(iii) Cargo loading.

3. Inventory control
(i) Economic order quantity

3. Define a feasible solution.

A solution to the LPP which satisfies the non-negativity restrictions of the LPP
is called a feasible solution

Feasible region:
A region in which all the constraints are satisfied simultaneously is called a
feasible region.

4. Define optimal solution.

Any feasible solution which optimizes the objective function is called its
optimal solution.

 What is meant by optimality test in a LPP?

By performing optimality test we can find whether the current feasible solution can be
improved or not. This is possible by finding the Z jC j row. In the case of a maximization
problem if all j j CZare nonnegative, then the current solution is optimal

5. define basic solution / feasible solution/basic feasible solution

1. Basic Solution

A basic solution is derived from the method of solving linear programming

problems using the simplex algorithm. It involves selecting a subset of variables (equal
to the number of constraints) to be non-zero while setting the remaining variables to
zero. The basic solution corresponds to a vertex (or corner point) of the feasible region
defined by the constraints. However, a basic solution is not necessarily feasible.
 2. Feasible Solution

A feasible solution is any solution that satisfies all the constraints of the linear
programming problem, including the non-negativity constraints (i.e., all variable values
must be greater than or equal to zero). Feasible solutions can be found within the
feasible region, which may include multiple points. A feasible solution does not need to
be optimal.

3. Basic Feasible Solution

A basic feasible solution is a special type of basic solution that is also feasible.
This means it satisfies all the constraints of the linear programming problem while being
formed by setting a specific number of variables (equal to the number of constraints) to
non-zero values and the rest to zero. Basic feasible solutions correspond to the vertices
of the feasible region and are candidates for the optimal solution in linear programming.

Summary

 Basic Solution: A solution with a specific number of variables set to non-zero,

not necessarily satisfying all constraints.
 Feasible Solution: A solution that satisfies all constraints, including non-
negativity.
 Basic Feasible Solution: A solution that is both basic and feasible; it satisfies
all constraints and corresponds to a vertex of the feasible region.
Understanding these distinctions is crucial in the context of linear programming,
especially when applying methods like the simplex algorithm to find optimal solutions.

6. Define unbounded solution.

If the values of the objective function Z can be increased or decreased indefinitely, such
solutions are called unbounded solutions.

7. What are the two forms of a LPP?

The two forms of linear programming problems (LPP) are the standard form and the canonical
form:

 Standard form: A simplified version of the canonical form

State the Characteristics of Standard form :
 Canonical form: Uses Boolean algebra to represent Boolean outputs of digital circuits

State the characteristics of canonical form.

The characteristics of canonical form are
i) The objective function is of maximization type
ii) All constraints are “ ” type
iii) All variables Xi are non negative.

8. What do you mean by standard form of LPP?

The standard form of a linear programming problem (LP) is a fixed format that's used to solve linear
programs using the Simplex Method. It has the following characteristics:

 Maximization: The objective function is to maximize the value, not minimize it.
 Non-negative variables: All variables are non-negative.
 Equality constraints: All constraints are in the form of equations.
 Less-than-or-equal-to inequalities: All linear constraints are in the form of less-than-or-equal-to inequalities.
The standard form of a linear programming problem is written as:
 Objective function: max z = ∑ c i x i
 Constraints: x i > 0

9. What do you mean by canonical form of LPP?

The canonical form of a linear program (LP) is a way of representing a linear

program with the following properties:

 Constraints: Only <= constraints are allowed.

 Objective function: The objective function must be maximized.
 Variables: All variables must be non-negative.

In matrix notation, the canonical form of an LP is:

 max { cx | x >= 0, Ax <= b }
 c: is a row vector with n elements
 x: is a column vector with n elements
 b: is a column vector with m elements
 A: is an m by n matrix
 The canonical form is used to construct the simplex method, which standardizes the algorithm
and uses the mechanics of the extreme points.

10. What are the limitations of LPP?

 Constraints: It can be difficult to specify constraints, even after the function is determined.
 Mathematical function: It can be difficult to determine the mathematical function in an LPP.
 Coefficient values: Determining the coefficient values at each step can be a problem.
 Assumptions: The assumptions made are not real because they are based on the elements in the
given situation.
 Solutions: The solutions obtained can always be real numbers.
 Relationships: LPP treats all relationships as linear, which is not true in many real-life
situations.
 Decision variables: In some LPPs, the decision variable would only be meaningful if it has
integer values.

11. What are the slack and surplus variables? (imp ques)

12. what is meant by decision variable?

n a linear programming problem (LPP), a decision variable is an unknown quantity that

the program tries to determine to solve the problem:

Definition
A decision variable is a physical quantity that a decision maker controls and is
represented by a mathematical symbol.

13. Define artificial variable.

Any non negative variable which is introduced in the constraint in order to

get the initial basic feasible solution is called artificial variable.

14. What are the methods used to solve an LPP involving artificial
variables?

. Big M method or penalty cost method

Two-phase simplex method

15. What is degeneracy?

The concept of obtaining a degenerate basic feasible solution in a LPP is known as

degeneracy. In the case of a BFS, all the non basic variables have zero value. If some basic
variable

s also have zero value, then the BFS is said to be a degenerate BFS.

16. How to Resolve degeneracy in LPP ?

17. Define non-degenerate solution

Solution:
A non-degenerate basic feasible solution is the basic feasible solution which
has exactly m positive Xi (i = 1, 2,------m) ie, none of the basic variables are zero.

18. Write the general mathematical model of LPP in matrix form.

Solution:
Max or Min Z = CX
Subject to AX ( ) b
X0
 UNIT-II
DUALITY, TRANSPORTATION MODEL AND
ASSIGNMENT MODEL
PART-A

UNIT II DUALITY, TRANSPORTATION MODEL AND ASSIGNMENT MODEL

Primal – Dual models – Dual simplex method – Mathematical formulation of

the problem –
Methods for finding an initial solution – North-West corner method, Least-cost
method, Vogel’s
Approximation Method (VAM) – Test for optimality – Variants of the
transportation problem –
Mathematical Formulation of the problem – Solution of an assignment
problem – Hungarian
algorithm – Variants of the assignment problem – Traveling salesman
problem
 2 marks :

1. Define dual of LPP.

The dual of a linear programming problem (LP) is another LP that has the same
data and solution as the original LP. The original LP is called the primal problem, and
the other LP is called the dual problem.

How to find the dual of an LP

1. Convert the primal LP's constraints to standard form
2. Identify the dual variables
3. Write the dual problem's objective function

2. What are the importance of the duality concept?

1. If. the primal problem contains a large number of rows and a smaller number of
columns, the computational procedure can be considerably reduced by converting it into dual and
then solving it.
2. This can help managers in answer questions about alternative course of actions and
their relative values.
3. Economic interpretation of the dual helps the management in making future decisions.
4. Calculation of the dual checks the accuracy of the primal solution.

3. State the optimality condition in dual simplex method.

In the dual simplex method, the optimality condition is when the resulting
value for the new variable in the new row is non-negative.
Explanation
 The dual simplex method is a variant of the primal simplex method.
 The dual simplex method is used to solve linear programming problems (LPPs)
where the initial basic solution is infeasible but better than optimal.
 The dual simplex method works towards feasibility, while the primal simplex method
works towards optimality.
 At the final optimal iteration, the solution is both primal and dual feasible

4. What is the difference between regular simplex method and dual

simplex
method?
 Simplex method starts with a non-optimal but feasible solution whereas dual simplex
method starts with an optimal but infeasible solution
. Simplex method maintains the feasibility during successive iterations whereas dual
simplex method maintains the optimality.

(to understand the

concept)

5. What is transportation problem? Is this a special class of LPP ? When does it a unique
solution ?

The transportation problem is to transport various amount of single object that are
initially stored at various origins, to different destinations in such a way that the total
transportation cost is minimum.
Yes it is a special class of LPP and may be solved by simplex method. Transportation
problem always posses a feasible solution.

It has a unique solution when cell evaluation matrix has only positive values

Write mathematical model for general transportation problem as LPP.

Mathematical formulation
Suppose that there are m sources and n destinations. Let a1be the number of supply units
available at source i (i =1, 2, 3 m) and let b1 be the number of demand units required at destination
j (f = 1, 2, 3 n). Let C, represent the unit transportation cost for transporting the units from source i
to distination j. The objective is to determine the number of units to be transported from source i to
destination j. So that total transportation cost is minimum.

6. List any three approaches used with T.P for determining the starting solution. or
List the various methods that can be used for obtaining an initial basic solution for
transportation problem.

1. North west corner method

2. Row minimum method
3. Column minimum method
4. Least cost method
5. Vogal approximation method.

7. What do you mean by degeneracy in a Transportation problem?

 In a transportation problem with m origins and n destinations if a basic feasible solution
has less than ( m + n—i) allocations, the problem is said to be a degenerate transportation
problem.

8. What do you mean by an unbalanced T.P?

An unbalanced transportation problem is a situation where the total supply of
goods is not equal to the total demand for those goods.

Explanation
 In a transportation problem, the goal is to assign a finite amount of goods from a
finite number of sources to a finite number of destinations.
 When the supply and demand are equal, the problem is balanced.
 When the supply and demand are not equal, the problem is unbalanced.
 To solve an unbalanced transportation problem, you can add a dummy row or
column to make it balanced.
 You can then solve the balanced problem using the same methods.

9.How do you convert the unbalanced T.P into a balanced one?

To convert an unbalanced transportation problem into a balanced one, you can add a
dummy row or column to account for the difference between supply and demand. The
transportation costs to the dummy row or column are set to zero.
Steps
1. Identify if the total supply is greater than or less than the total demand
2. If the supply is greater than demand, add a dummy destination
3. If the demand is greater than supply, add a dummy origin
4. Set the transportation costs to zero for the dummy row or column
5. Solve the problem as if it were balanced

10.What is an assignment problem?

 11.List the various methods are used to solve the assignment
problems?

An assignment problem is a problem where resources are assigned to tasks to minimize cost
or maximize profit. The goal is to find the optimal one-to-one matching between sources and
destinations

There are mainly four methods to solve assignment problems:

 Hungarian method.
 Enumeration Method.
 Simplex method.
 Transportation method.

 Hungarian method: An efficient algorithm that uses a matrix approach to find the
optimal solution. It reduces the cost matrix to a matrix of opportunity costs.
 Enumeration method: A method that calculates the cost for all possible assignments
and then selects the solution with the lowest cost. This method is best for smaller
problems.
 Simplex method: A linear programming method that can be used to solve assignment
problems.
 Transportation method: A method that can be used to solve assignment problems.
 Genetic algorithms (GA): A meta heuristic technique that mimics natural selection to
find optimal solutions.
 Evolutionary algorithms (EA): A meta heuristic technique that mimics natural
selection to find optimal solutions.

12. What do you mean by an an unbalanced assignment problem?

Unbalanced Assignment Problem

If number of rows is not equal to number of columns then it is called Unbalanced Assignment
Problem.
So to solve this problem, we have to add dummy rows or columns with cost 0, to make it a
square matrix.

13.State the difference between the T.P and A.P.

.
 14.What is the objective of the travelling salesman problem?

The objective of the Traveling Salesman Problem (TSP) is to find the shortest
route that visits every city once and returns to the starting point.

Explanation
 The TSP is a well-known optimization problem in computer science and operations
research.
 It's a combinatorial optimization problem, which means that the number of possible
solutions grows exponentially with the number of cities.
 The TSP is NP-hard, which means that finding an exact solution requires a lot of
computer power.
 The TSP has many real-world applications, such as in logistics and delivery
businesses.
Applications
 Finding more efficient routes can help delivery businesses increase profitability and
reduce greenhouse gas emissions.
 Salespeople can use the TSP to plan optimal travel routes and avoid missed
appointments.

15.How do you convert the maximization assignment problem into a

minimization one?

To convert a maximization assignment problem into a minimization problem,

you can subtract each element in the cost matrix from the highest element. This is
also known as the "Opportunity Loss Matrix".

Steps:

1. Find the highest element in the matrix

2. Subtract each element in the matrix from the highest element
3. The result is the "Opportunity Loss Matrix"
4. The "Opportunity Loss Matrix" has a zero in the place of the highest element
5. The assignment problem now has a minimization objective

16. Explain how the profit maximization transportation problem can be

converted to an equivalent cost minimization transportation problem.

To convert a profit maximization transportation problem to a cost minimization

transportation problem, you can subtract each unit cost from the highest unit cost in
the table.
Steps
1. Construct a transportation matrix using the given data
2. Check if the problem is balanced, meaning supply equals demand
3. If the problem is unbalanced, add a dummy source or destination to balance it
4. Subtract each unit cost from the highest unit cost
5. Create a column reduce matrix by subtracting the lowest value in the first column
from the other values in that column
6. Repeat the process for the remaining columns
7. Repeat the process for the rows
8. Add the column and row reduce matrices to create a modified minimization matrix
9. Determine the penalty by subtracting the highest value from the lowest in each row
and column
10. Assign the greatest supply or demand to the lowest value with the highest penalty .

Describe the steps involved in vogal approximation method (VAM).

Ans.
Setp. 1. For each row of the transportation table identify the smallest and next to smallest cost.
Determine the difference between them for each row. These are called penalities.’ Similarly
compute these penalities for each column.
Setp. 2. Identify the row or column with the largest penalty and allocate as much as possible
within the restrictions of the rim conditions to the lowest cost cell in the row or column selected.
Setp. 3. Cross out of the row or column completely satisfied by the allocation.
Setp. 4. Repeat steps 1 to 3 untill all assignment have been made.

Define the following terms in transportation Problem.

(i) feasible solution (ii) Optimal solution
1. Feasible Solution. A feasible solution to a transportation problem is a set of non negative
allocations, x that satisfy the rim conditions.
2. Optimal Solution. A feasible solution that minimize the transportation cost is called the
optimal Solution

Explain North west corner rule for finding initial solution for a transportation problem.
(a) If D1< S1, set x11 equal to find the balance supply and demand and proceed horizontally (cell 1,
2).
(b) If = S1 set x11 equal to D1, find the balance supply and demand and proceed diagonally (cell 2,
2).
(c) If D1>S1, set x11equal to compute the baiance supply and demand and proceed vertically (cell 2,
1).
2. Continue in this manner, step by step away from the north west corner until, finally a value is
reached in the south east corner.
State the Assignment model. Is assignment problem a special case of transportation?
Assignment Model Suppose there are n jobs to be performed and n person are available for doing
these jobs. Assume that each person can do each job at a time, though with varying degree of
efficiency.The problem is to find an assignment so that the total cost for performmg all jobs is
minimum
Yes, the assignment problem is a special case of transportation problem when each
origin is associated with one and only one destination.
What do you mean by restrictions an assignments?
Or
How a restriction problem tackled?
Or
How will you solve an assignment where a particular assignment is prohibited?
Sometime technical, space, legal’or other problems do not permit the assignment of a particular
facility to a particularjob. Such problem are known restrictions an assignment problem. Such
problem can be solved by assigning a very heavy cost to the corresponding cell. It will automatically
excluded from further consideration.

Describe the steps involved in solving assignment problem by Hungarian method.

1. Prepare a square matrix.

2. Reduce the matrix.
3. Check whether an optimal assignment can be made in the reduced matrix or not.
4. Find the minimum number of lines crossing all zeros. If this number of lines is equal to the order
of matrix then it is an optimal solution. Otherwise gp to step 5.
5. Iterate towards the optimal solution.
6. Repeat step 3 through 5 until an optimal solution is obtained.

Distinguish between transportation, assignment and sequencing model what is sequencing

model).
Ans. Transportation and assignment are allocation model (as explained above) Sequencing
model. are applicable in situation in which the effectiveness measure
a function of order as sequence of performing a series of jobs. The selection of the apropriate
order in which waiting customer/Job may be served is called sequencing