LINEAR PROGRAMMING:

In a military operation, the effort is to inflict maximum

damage to enemy at minimum cost and ss. In an industry,
the management always tries to utilise its resources in the
best posible m The industrialist would like to have
unlimited profits, but he is constrained by limited
manpower. capital and market demand. A salaried person
tries to make investments in such a manner that the
sturns on investment are high but at the same time income
tax liability is also kept low
In all the above cases, if constraints are represented by
linear equatiom/inequations in one, two or more variables),
and a particular plan of action from several alternatives is
to be chosen then, we use linear programming to be
maximized or minimized are linear, and the word
programming refers to planning (choosing amongst
alternatives) rather than the computer programming sense.
American economist Dantzig is credited with developing the
subject of linear programming .Thus linear programming is
a method for determining optimum values of a linear
function subject to constraints expressed as linear
equations or inequalities
A practical problem may involve dozens of variables, and is
usually solved by using Simples Method and a computer.
In this chapter, we will restrict ourselves to linear functions
involving twe variables, so that they can be solved by
drawing graph on xy-plane
TYPES OF CLASSICAL LINEAR PROGRAMMING:
 Transportation problems

Transportation problems are another type of linear

programming problem, mainly concerned with studying
effective transportation routes. Transportation problems
mainly include studying how effectively one product is
carried from one area to another so that the final
transportation cost can be minimised.

In large-scale organisations, it sometimes becomes nearly

impossible to analyse transportation issues. Here, the
objective function is the transportation cost, whereas
constraints are the demand and supply patterns.

 Manufacturing problems

The manufacturing problems involve maximising

production and profits earned from manufactured
products, which might be the function of workers engaged
in the production, available workspace, packing materials
utilised, machine hours, product’s market worth, raw
materials required, etc. Here, the objective function is the
production rate, whereas constraints are factors including
the cost of packing materials, labour hours, and so on.

 Diet Problems

The diet problems mainly comprise the intake of a specific

food item, affecting the overall diet plan. The purpose of the
diet problem is to find a set of food items that can meet the
daily nutritional needs while spending the least amount of
money. Here, the objective function is the cost of food
consumed, whereas constraints are meeting nutritional
needs, taking calories, etc.

BASIC REQUIREMENTS OF LINEAR PROGRAMMING

 Linear Programming (LP) is a quantitative technique used
to optimize a linear objective function, subject to a set of
linear constraints. The basic requirements of Linear
Programming are:
1. Linearity:

 The objective function and all constraints must be linear.

 The objective function and constraints should be expressed
as linear equations or inequalities.

2. Single Objective:

 LP problems should have a single objective or goal, which

is to maximize or minimize.

3. Deterministic Coefficients:

 The coefficients of the decision variables in the objective

function and constraints should be known and constant.

4. Divisibility:

 The decision variables should be divisible, allowing

fractional solutions.

5. Non-Negativity:

 Decision variables should be non-negative (≥ 0).

6. Constraints:

 LP problems should have constraints limiting the values of

decision variables.

7. Alternative Solutions:
 LP problems may have alternative optimal solutions.

Key Components:

1. Decision Variables: Represent the choices or

unknowns.
2. Objective Function: Represents the goal (maximize or
minimize).
3. Constraints: Limit the values of decision variables.
4. Constants: Known values in the objective function and
constraints.

Example:
Maximize Profit (Z) = 2x + 3y
Subject to:

 2x + y ≤ 4 (Constraint 1)
 x + 2y ≤ 3 (Constraint 2)
 x, y ≥ 0 (Non-Negativity)

Here, x and y are decision variables, Z is the objective

function, and constraints limit the possible values of x and
y.
ADVANTAGES OF LINEAR PROGRAMMING

Linear Programming (LP) offers numerous advantages in

various fields, including business, economics, operations
research, and engineering. Some of the key benefits of LP
are:

1. Optimization: LP enables the optimal allocation of

resources, maximizing profits or minimizing costs.
 2. Efficient Resource Utilization: LP helps identify the
most efficient use of resources, reducing waste and
improving productivity.

3. Decision Making: LP provides a systematic approach

to decision-making, considering multiple constraints
and objectives.

4. Cost Reduction: LP minimizes costs by identifying the

most cost-effective solutions.

5. Improved Resource Allocation: LP allocates

resources effectively, ensuring maximum utilization.

6. Simplified Complex Problems: LP breaks down

complex problems into manageable linear equations.

DISADVANTAGES OF LINEAR PROGRAMMING :

Linearity Assumption: LP assumes linear relationships

between variables, which may not always hold true in real-
world scenarios.

Simplification: LP simplifies complex problems, potentially

overlooking important factors.

Limited Flexibility: LP models can be inflexible, making

it difficult to incorporate changes or uncertainties.

Assumes Certainty: LP assumes known and constant

coefficients, ignoring uncertainty and variability.

Difficulty in Modeling: LP requires accurate modeling,

which can be challenging, especially for complex systems.
 Computational Complexity: Large-scale LP problems can
be computationally intensive.

FORMULATION OF AN L.P.P IN TWO VARIABLES x AND y:

There are three steps in the mathematical formulation of

an LPP. and solving it. These are:

(1) To identify the objective function as a linear

combination of variables (x and y) and to construct all
constraints ie. linear equations and inequations involving
these variables. Thus, an L.P.P. can be stated
mathematically as Maximize (or minimize) 2 = ax + by
subject to the conditions ax+bys (or zor=or > or <) c, where
i=1 to n and the non-negative restrictions

x≥ 0, y≥0.
(ii) To find the solutions (feasible region) of these equations
and inequations by some mathematical method. Here we
will study only the graphical method.

(iii) To find the optimal solution ie, to select particular

values of the variables x and y that give the desired value
(maximum/minimum) of the objective function.

GRAPHICAL METHOD OF SOLVING LPP:

The following theorems are fundamental in solving LPP.

Theorem 1. Let R be the feasible region for an LPP. and be

the objective function. Z = ax + by When Z has an optimal
value (maximum or minimum), constraints described by
linear inequalities, this optimal value must occur at a
corner point (vertex) of the feasible region.
Theorem 2. Let R be the feasible region for an L.P.P. and Z
= ax + by be the objective function. If Ris bounded, then
the objective function Z has both a a minimum value on R
and each of these occurs at a corner point (vertex) of R.

Remark

If R is unbounded, then objective function may or may not

have a maximum or minimum value However, if it
(maximum/minimum) exists, then by Theorem 1, it must
occur at corner point of R

Corner Point Method

To solve an L.P.P. graphically, we follow these steps

1. Convert the given linear constraints into equalities and

then draw their graphs which will be straight lines.

2. Find the feasible region of the L.P.P. and find the corner
points.

3. Evaluate the objective function Z = ax + by at each

corner point, and let M and or be respectively the largest
and smallest values.

4. If feasible region R is bounded, then M and mare the

maximum and minimum values of 2

5. If feasible region R is unbounded, then

(4) M is the maximum value of Z if the open half plane ax +
by > M has no point in commen with the feasible region.
Otherwise Z has no maximum value.

(b) w is the minimum value of Z if the open half plane ax by

< m has no point in common with the feasible region.
Otherwise Z has no minimum value.

6. If two corner points of the feasible region are both

optimal solutions of the same type Le both give the same
maximum/minimum values, then every point on the line
segment joining these points gives the same optimal
solution.

ISO-PROFIT AND ISO-COST METHOD OF SOLVING L.P.P:

In this method, we choose a fixed value k of the objective
function such that Z=ax+by=k is a straight line, called iso-
profit/Iso-cost line as every point on this line will yield
same (iso) cost(=k). Now move this line parallel to itself over
the feasible region so that it passes through al corner
points
For maximization, the corner point corresponding to iso-
profit line farthest from the origje gives maximum value of
2. For minimisation, the corner point corresponding to iso-
cost line closest to the origin gives minimum value of Z. If
the objective function has same slope as one of the
constraints, the iso-profit or iso-cost line will coincide with
one of the outer lines of the feasible region and may have
infinite number of optimal solutions
To solve an LIPP by using iso-profit Fiso-cost method we
follow these steps:
1. Convert the linear constraints into equalities and then
draw theit graphs, which will be straight lines
2. Find the feasible region of the LPP and find the corner
points
3. Choose a fixed value (say k) of the objective function Z
such that Z = ax + by = k
straight line and draw this line in xy plane
4.(i) If the object is to maximise Z then line drawn in step
3 is called iso-profit line. Man
this line parallel to itself over the feasible region, so that it
passes through all corner
points. The comer point corresponding to iso-profit line
farthest from the engin
gives the maximum value of Z.
(ii) If the object is to minimise Z. then line drawn in step 3
is called iso-cost line. Move this line parallel to itself over
the feasible region, so that it passes through all corner
points. The corner point corresponding to iso-cost line
nearest to the origin g the minimum value of Z.