Online Text Editor PDF
Online Text Editor PDF
Online Text Editor PDF
(i) Magnitude of Computation - Operations research models try to find out optimal solution
taking into account all the factors. These factors are enormous and expressing them in
quantity and establishing relationships among these require voluminous calculations which
can be handled by computers. (ii) Non-Quantifiable Factors - OR provides solution only
when all elements related to a problem can be quantified. All relevant variables do not lend
themselves to quantification. Factors which cannot be quantified find no place in OR study.
Models in OR do not take into account qualitative factors or emotional factors which may be
quite important. (iii) Distance between User and Analyst - OR being specialist’s job
requires a mathematician or statistician, who might not be aware of the business problems.
Similarly, a manager fails to understand the complex working of OR. Thus there is a gap
between the two. Management itself may offer a lot of resistance due to conventional
thinking.
(iv)Time and Money Costs - When basic data are subjected to frequent changes,
incorporating them into the OR models is a costly proposition. Moreover, a fairly good
solution at present may be more desirable than a perfect OR solution available after
sometime. The computational time increases depending upon the size of the problem and
accuracy of results desired. (v) Implementation - Implementation of any decision is a
delicate task. It must take into account the complexities of human relations and behaviour.
Sometimes, resistance is offered due to psychological factors which may not have any bearing
on the problem as well as its solution.
Feasible solution :- Any point in the feasible region of a linear programming problem that
gives the optimal value (maximum or minimum) of the objective function is called an optimal
(feasible) solution. Observe the following figure:
In figure, the feasible region of a linear inequations is the region bounded by OABC. So,
every point in this region satisfies the given conditions in this region. This is called an
optimal solution.
Optimal solution :- The solution which gives the maximum or the minimum objective
function value is the Optimal Solution. An optimal solution to a linear program is the solution
which satisfies all constraints with maximum or minimum objective function value In simpler
words, In a linear programming question we are given an objective function, some constraints
and we have to find minimum or maximum values. So after applying the constraints we get a
feasible region which is the set of all solutions which satisfies all the constraints. Now using
the extreme points in the region, the solution which gives the maximum or the minimum
Page 1 of 2
objective function value is the Optimal solution.
Page 2 of 2