Mind map : learning made simple Chapter - 12

Theorem I : Let R be the feasible region (convex polygon) for a A. L.P.P is one that is concerned with finding the optimal value
L.P. and let Z=ax+by be the objective function. When Z has an (max. or min.) of a linear function of several variables
optimal value (max. or min.), where the variables x,y are subject (called objective function) subject to the conditions that the
to the constraints described by linear inequalities, this optimal variables are non-negative and satisty a set of linear inequalities
value must occur at a corner point (vertex) of the feasible region, (called linear constraints). Variables are sometimes called decision
Theorem 2: Let R be the feasible region for a L.P.P, and let Z=ax+by variables and are non-negative.
be the objective function. If R is bounded then the O.F Z has
both a max. and a min. value on R and each of these occurs at a (i) Diet problems
corner point (vertex) of R. If the feasible region is unbounded, (ii) Manufacturing Problem
then a max. or a min. may not exist. If it exists, it must occur at a (iii) Transportation Problems
corner point of R.
The common region determined by all the
constraints including the non-negative constraint
x ≥ 0, y ≥ 0 of a L.P.P is called the feasible region
(or solution region) for the problem. Points within
Linear
and on the boundary of the feasible region
Programming
represent feasible solutions of the constraints. Any
point outside the feasible region is an infeasible
solution. Any point in the feasible region that gives
the optimal value (max. or min.) of the objective
(i)Find the feasible region of the L.P.P and determine its corner function is called an optimal solution.
points (vertices). (ii) Evaluate the O.F. Z = ax+by at each corner
For eg : Max Z = 250x + 75y , subject to the
point. Let M and m be the largest and smallest values respectively
Constraints: 5 x + y ≤ 100
at these points. If the feasible region is unbounded, M and m are x + y ≤ 60
the maximum and minimum values of the O.F. If the feasible region x ≥ 0, y ≥ 0 is an L.P.P.
is unbounded , then (i) 'M' is the max. value of the O.F., if the open
half plane determined by ax+by>M has no point in common with
the feasible region. Otherwise, the O.F. has no maximum value.
(ii) 'm' is the minimum value of the O.F., if the open half plane
determined by ax+by <m has no point in common with the feasible
region. Otherwise, the O.F. has no minimum value.