INSTITUTE-USB

DEPARTMENT-BBA
Bachelor Of Business Administration
Operation Research(20BAT-263)
Instructor: Dr. Gifty Malhotra

Operation Research(BAT-308)
Operation Research(20BAT-263) DISCOVER . LEARN . EMPOWER
Operation Research(BAT-308)
 OPERATION RESEARCH
Course Outcome
CO Number Title Level

CO1 Define and formulate linear programming problems and Understand

appreciate their limitations

CO2 Solve linear programming problems using appropriate techniques Application

and optimization solvers, interpret the results obtained and

translate solutions into directives for action.
CO3 Conduct and interpret post-optimal and sensitivity analysis and Analyze
explain the primal-dual relationship.
CO4 Develop mathematical skills to analyze and solve integer Evaluate

programming and network models arising from a wide range of

applications.
CO5 Understand the usage of game theory and Simulation for Solving Application
Business Problem

https://www.or.tum.de/en/home/
2
Unbounded Solution
• The unbounded solutions typically arise because some real
constraints, which represent a practical resource limitation, have
been missed from the linear programming formulation. In such
situation the problem needs to be reformulated and re-solved.
• When the feasible region is unbounded, a maximization problem may
don’t have optimal solution, since the values of the decision variables
may be increased arbitrarily.

3
Unbounded feasible region Example
This is illustrated with the help of the following problem.
Maximize
3x1 + x2
Subject to:
x1 + x2 ≥ 6
-x1 + x2 ≤ 6
-x1 + 2x2 ≥ -6
and
x1, x2 ≥ 0

4
Graphical Reprentation of the equations

5
 Unbouned feasible region
• Graph shows the unbounded
feasible region and
demonstrates that the objective
function can be made arbitrarily
large by increasing the values of
x1 and x2 within the unbounded
feasible region. In this case,
there is no point (x1, x2) is
optimal because there are
always other feasible points for
which objective function is
larger.

6
Infeasible Solution
• A linear programming problem is said to be infeasible if no feasible
solution of the problem exists. This section describes infeasible
solution of the linear programming problem with the help of the
following Example:

7
Example
Infeasible region problem in LPP can be explained with the help of the following
example

Minimize
200x1 + 300x2
Subject to the constraints

4x1 + 6x2 ≥ 2400

2x1 + 2x2 ≤ 800
4x1 + 3x2 ≥ 1800
and
x1, x2 ≥ 0

8
Infeasible Solution
• The above equations can be
represented in the graph shown here.
• The region right of the boundary AFE
includes all the solutions which satisfy
the first (4x1 + 6x2≥ 2400) and the
third (4x1 + 3x2 ≥ 1800) constraints.
The region left of the BC contains all
solutions which satisfy the second
constraint (2x1 + 2x2 ≤ 800).
• Hence, there is no solution satisfying
all the three constraints (first, second,
and third). Thus, the linear problem is
infeasible.
9
Recommended Text Books:

• Budnik, Frank S. Dennis Mcleavey, Reichard : Principles of Operations Research, 2nd ed.,

• Richard Irwin, Illinois – All India Traveler Bookseller, New Delhi, 1995.

• Gould, F.J. etc. : Introduction to Management Science, Englewood Cliffs, New Jersey, Prentice Hall Inc., 1993.

• Mathur, K and Solow, D. : Management Science, Englewood, New Jersey, Prentice Hall Inc., 1994.

Reference Books:

• N.D. Vohra : Quantitative Techniques in Management, Tata McGraw Hill, 2101.

• Sharma, J.K.: Operations Research : Theory and Applications, New Delhi, Macmillian India Ltd., 1997.

• Narang A.S. : Linear Programming Decision-Making. New Delhi, Sultan Chand, 1995.
 THANK YOU

For queries
Email: gifty.e10958@cumail.in