Scribd
Upload
62 views

Graphical Method

organisational behaviour

Uploaded by

Anjani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
62 views

Graphical Method

organisational behaviour

Uploaded by

Anjani
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Graphical Method

Linear programming (LP) is an optimization technique for a system of linear constraints and
a linear objective function. An objective function defines the quantity to be optimized, and the
goal of linear programming is to find the values of the variables that maximize or minimize the
objective function.

Generally, in any organization there are two major objectives:


1. Minimization (of total cost of production).
2. Maximization (of their profit).

Introduction

Linear programming problems involving two decision variables can easily be solved by
graphical method. If the problem has three or more variables, the graphical method is not
suitable.

Graphical Solution Method

The major steps in the solution of a linear programming problem by graphical method are
summarized as follows:
Step 1: Identify the problem - the decision variables, the objective and the restrictions.
Step 2: Set up the mathematical formulation of the problem.
Step 3: Plot a graph representing all the constraints of the problem and identify the feasible region
(solution space). The feasible region is the intersection of all the regions represented by the
constraints of the problem and is restricted to the first quadrant only.
Step 4: The feasible region obtained in step 3 may be bounded or unbounded. Compute the
coordinates of all the corner points of the feasible region.
Step 5: Find out the value of the objective function at each corner (solution) point determined in
step 4.
Step 6: Select the corner point that optimizes (maximizes or minimizes) the value of the
objective function. It gives the optimum feasible solution.

Sample Problems

1
A company makes two kinds of leather belts. Belt A is a high quality belt, and belt B is of lower
quality. The respective profits are Rs. 4.00 and Rs. 3.00 per belt. Each belt of type A requires
twice as much time as a belt of type B, and if all belts were of type B, the company could make
1000 belts per day. The supply of leather is sufficient for only 800 belts per day (Both A and B
combined). Belt A requires a fancy buckle and only 400 buckles per day are available. There are
only 700 buckles a day available for belt B. Determine the optimal product mix.
2
A farm is engaged in breeding pigs. The pigs are fed on various products grown on the farm. In
view of the need to ensure certain nutrient constituents (call them X, Y and Z), it is necessary to
buy two additional products, say, A and B. One unit of product A contains 36 units of X. 3 units
of Y and 20 units of Z. One unit of product B contains 6 units of X, 12 units of Y and 10 units of
Z. The minimum requirement of X, Y and Z is 108 units, 36 units and 100 units respectively.
Product A costs Rs. 20 per unit and product B Rs. 40 per unit.

Formulate the above as a linear programming problem to minimize the total cost, and solve the
problem by using graphic method.
Some Exceptional Cases

The following three special cases that arise in the application of the graphical method:
(1)Alternative optima, (2) Unbounded solution, and (3) Infeasible (or non-existing) solution.

1. Alternative optima: When the objective function is parallel to a binding constraint (i.e.. a
constraint that is satisfied as an equation by the optimal solution), the objective function will
assume the same optimum value at more than one solution point. For this reason they are called
alternative optima.

3
Use graphical method to solve the LP.P.:
Maximize z = 2x1 + 4x2
Subject to the constraints: x1 + 2x2 ≤ 5, x1 + x2 ≤ 4; and x1, x2 ≥ 0.

2. Unbounded solution: When the values of the decision variables may be increased indefinitely
without violating any of the constraints, the solution space (feasible region) is unbounded. The
value of objective function, in such cases, may increase (for maximization) or decrease (for
minimization) indefinitely. Thus, both the solution space and the objective function value are
unbounded.

4
Use graphical method to solve the following L.P.P.:
Maximize z = 6x1 + x2
Subject to the constraints: 2x1 + x2 ≥ 3, x2 – x1 ≥ 0; and x1, x2 ≥ 0.
3. Infeasible solution: When the constraints are not satisfied simultaneously, the linear
programming problem has no feasible solution. This situation can never occur if all the
constraints are of the ≤ type.

5
Solve the following L.P.P.:
Maximize z = x1 + x2
Subjec1 t the constraints: x1 + x2 ≤ 1, -3x1 + x2 ≥ 3; and x1, x2 ≥ 0.
Graphical Sensitivity Analysis:
Sensitivity analysis (or post-optimality analysis) is used to determine how ‘sensitive’ the
optimal solution is affected by changes, within specified ranges, in:
1. The objective function coefficients (OFC)
2. The right-hand side (RHS) value of a constraint.

Sensitivity analysis is important to a manager who must operate in a dynamic environment with
imprecise estimates of the coefficients.

Sensitivity analysis allows a manager to ask certain what-if questions about the problem.

For LP problems with two decision variables, graphical solution methods can be used to perform
sensitivity analysis on
1. The objective function coefficients, and
2. The right-hand-side values for the constraints.

You might also like