Dr.

B Dayal
Dr. B Dayal
 GRAPHICAL METHODS TO SOLVE
WORKING RULE
LPP
THE METHOD OF SOLVING A LPP ON THE BASIS OF THE ABOVE
ANALYSIS IS KNOWN AS GRAPHICAL METHOD.
 STEP 1: WRITE DOWN THE EQUATIONS BY REPLACING THE
INEQUALITY SYMBOLS BY THE EQUALITY SYMBOLS IN THE
GIVEN CONSTRAINTS.
 STEP 2: PLOT THE STRAIGHT LINES REPRESENTED BY THE
EQUATIONS OBTAINED IN STEP 1.
 STEP 3: IDENTIFY THE CONVEX POLYGON REGION RELEVANT
TO THE PROBLEM. DECIDE ON WHICH SIDE OF THE LINE THE
HALF PLANE IS LOCATED.
 STEP 4: DETERMINE THE VERTICES OF THE POLYGON AND
FIND THE VALUES OF THE GIVEN OBJECTIVE FUNCTION Z AT
EACH OF THESE VERTICES. IDENTIFY THE GREATEST AND
LEAST OF THESE VALUES. THESE ARE RESPECTIVELY THE
MAXIMUM AND MINIMUM VALUES OF Z.
 STEP 5: IDENTIFY THE VALUES OF (x1, x2) WHICH
CORRESPOND TO THE DESIRED EXTREME VALUES OF Z. THIS
IS AN OPTIMAL SOLUTION OF THE PROBLEM.
 EXAMPLE
MAXIMISE Z = 700X1 + 500X2
SUBJECT TO:
4X1 + 3X2 ≤ 210
2X1 + X2 ≤ 90
AND X1 ≥ 0, X2 ≥ 0.
 CASE STUDY 1
A FIRM ENGAGED IN PRODUCING 2 MODELS, VIZ,
MODEL A AND MODEL B, PERFORMS ONLY 3
OPERATIONS PAINTING, ASSEMBLY AND TESTING. THE
RELEVANT DATA ARE AS FOLLOWS:
UNIT SALE PRICE HOURS REQUIRE D FOR EACH UNIT
ASSEMBLY PAINTING TESTING
MODEL A BIRR 50/- 1.0 0.2 0.0
MODEL B BIRR 80/- 1.5 0.2 0.1

TOTAL NUMBERS OF HOURS AVAILABLE EACH WEEK ARE

FOR ASSEMBLY 600, PAINTING 100, TESTING 30. THE
FIRM WISHES TO DETERMINE THE WEEKLY PRODUCT
MIX SO AS TO MAXIMISE REVENUE.
 SOLVED PROBLEM 2
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MINIMISE Z = 20X + 10Y
SUBJECT TO THE CONSTRAINTS
X + 2Y ≤ 40
3X + Y ≥ 30
4X + 3Y ≥ 60
AND X,Y ≥ 0
 SOME BASIC DEFINITIONS
 FEASIBLE REGION: ANY NON – NEGATIVE VALUE OF (X1,
X2) (i.e., X1 ≥ 0, X2 ≥ 0) IS A FEASIBLE SOLUTION OF THE
LPP IF IT SATISFIES ALL THE CONSTRAINTS. THE
COLLECTION OF ALL FEASIBLE SOLUTION IS KNOWN AS
THE FEASIBLE REGION.
 CONVEX: A SET X IS CONVEX IF FOR ANY POINTS x1, x2
IN X , THE LINE SEGMENT JOINING THESE POINTS IS
ALSO IN X.THAT IS x1, x2 belong to X.
 HALF PLANE: A LINEAR INEQUALITY IN TWO
VARIABLES IS KNOWN AS HALF PLANE. THE
CORRESPONDING EQUALITY OR LINE IS KNOWN AS THE
BOUNDARY OF THE HALF PLANE.
 CONVEX POLYGON: A CONVEX POLYGON IS A CONVEX
SET FORMED BY THE INTERSECTION OF FINITE NUMBER
OF CLOSED HALF PLANES.
 REDUNDENT CONSTRAINT: A CONSTRAINT WHICH
DOES NOT AFFECT THE FEASIBLE REGION.
 SOME BASIC DEFINITIONS
BASIC FEASIBLE SOLUTION: A BASIC
FEASIBLE SOLUTION OF A SYSTEM OF m
EQUATIONS AND n VARIABLES (m < n) IS A
SOLUTION WHERE m VARIABLES ARE
NON NEGATIVE (≥ 0) AND n – m
VARIABLES ARE 0.
OPTIMAL FEASIBLE SOLUTION: ANY
FEASIBLE SOLUTION THAT OPTIMISES
THE OBJECTIVE FUNCTION IS CALLED AN
OPTIMAL FEASIBLE SOLUTION.
 SOME EXCEPTIONAL CASES
 A UNIQUE OPTIMAL SOLUTION: IN THIS CASE ONLY ONE SOLUTION
WILL BE OBTAINED IN A GRAPHICAL SOLUTION.
 MULTIPLE OPTIMAL SOLUTIONS / ALTERNATIVE SOLUTION: 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 OPTIMAL VALUE AT MORE
THAN ONE SOLUTION POINT. FOR THIS REASON THEY ARE CALLED
ALTERNATIVE OPTIMA.
 AN 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 UNBOUNDE. THE VALUE OF THE OBJECTIVE
FUNCTION IN SUCH CASES MAY INCREASE (FOR MAXIMISATION)
OR DECREASE (FOR MINIMISATION) INDEFINITELY. THUS BOTH THE
SOLUTION SPACE AND THE OBJECTIVE FUNCTION VALUE ARE
UNBOUNDED.
 NO SOLUTION / INFEASIBLE SOLUTION: WHEN THE CONSTRAINTS
ARE NOT SATISFIED SIMULTENEOUSLY, THE LINEAR
PROGRAMMING PROBLEM HAS NO ANY FEASIBLE SOLUTION. THIS
PROBLEM CAN NEVER OCCUR IF ALL THE CONSTRAINTS ARE OF
THE ‘≤’ TYPE.
 SOLVED PROBLEM 3 (multiple
optimal solutions)
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MAXIMISE Z = 350X + 700Y
SUBJECT TO THE CONSTRAINTS
X + 2Y ≤ 5
X+Y≤4
AND X,Y ≥ 0
 SOLVED PROBLEM 4
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MAXIMISE Z = 3X1 + 2X2
SUNJECT TO THE CONSTRAINTS
X1 - X2 ≤ 1
X1 + X2 ≥ 3
AND X1 ≥ 0, X2 ≥ 0
 EXAMPLE SOLVED PROBLEM
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MAXIMISE Z = 3X1 - 2X2
SUBJECT TO THE CONSTRAINTS
X1 + X2 ≤ 1
2X1 + 2X2 ≥ 4
AND X1 ≥ 0, X2 ≥ 0
 TERMINAL QUESTION 1
USE THE GRAPHICAL METHOD TO SOLVE THE LPP.
MAXIMISE Z = 5X1 + 3X2
SUBJECT TO:
3X1 + 5X2 ≤ 15
5X1 + 2X2 ≤ 10
X1, X2 ≥ 0
TERMINAL QUESTION 2
MAXIMISE Z = 2X1 + 4X2
SUBJECT TO CONSTRAINTS:
X1 + 2X2 ≤ 5
X1 + X2 ≤ 4
X1, X2 ≥ 0
 TERMINAL QUESTION 3
USE THE GRAPHICAL METHOD TO SOLVE THE
LPP.
MAXIMISE Z = 6X1 + X2
SUBJECT TO:
2X1 + X2 ≥ 3
X1 - X2 ≥ 0
X1, X2 ≥ 0
 LIMITATIONS OF LPP
 IN SOME PROBLEMS OBJECTIVE FUNCTIONS AND CONSTRAINTS ARE NOT
LINEAR. GENERALLY IN REAL LIFE SITUATIONS CONCERNING BUSINESS
AND INDUSTRIAL PROBLEMS CONSTRAINTS ARE NOT LINEARLY TREATED
TO VARIABLES.
 THERE IS NO GUARANTEE OF GETTING INTEGER VALUED SOLUTIONS, FOR
EXAMPLE, IN FINDING OUT HOW MANY MEN AND MACHINES WOULD BE
REQUIRED TO PERFORM A PARTICULAR JOB, ROUNDING OFF THE
SOLUTION TO THE NEAREST INTEGER WILL NOT GIVE AN OPTIMAL
SOLUTION. INTEGER PROGRAMMING DEALS WITH SUCH PROBLEMS.
 A LINEAR PROGRAMMING MODEL DOES NOT TAKE INTO CONSIDERATION
THE EFFECT OF TIME AND UNCERTAINTY. THUS THE MODEL SHOULD BE
DEFINED IN SUCH A WAY THAT ANY CHANGE DUE TO INTERNAL AS WELL
AS EXTERNAL FACTORS CAN BE INCORPORATED.
 SOME TIMES LARGE SCALE PROBLEMS CANNOT BE SOLVED WITH LINEAR
PROGRAMMING TECHNIQUES EVEN WHEN THE COMPUTER FACILITY IS
AVAILABLE. SUCH DIFFICULTY MAY BE REMOVED BY DECOMPOSING THE
MAIN PROBLEM INTO SEVERAL SMALL PROBLEMS AND THEN SOLVING
THEM SEPERATELY.
 PARAMETERS APPEARING IN THE MODEL ARE ASSUMED TO BE A
CONSTANT. BUT IN REAL LIFE SITUATIONS THEY ARE NEITHER CONSTANT
NOR DETERMONISTIC.
 LINEAR PROGRAMMING DEALS WITH ONLY SINGLE OBJECTIVE WHEREAS
IN REAL LIFE SITUATIONS PROBLEMS COME ACROSS WITH MULTI –
OBJECTIVES. GOAL PROGRAMMING AND MULTI – OBJECTIVE
PROGRAMMING DEAL WITH SUCH PROBLEMS.
 ADVANTAGES OF LPP
HELPS IN MAKING THE OPTIMUM UTILISATION
OF RESOURCES. ALSO INDICATES HOW A
DECISION MAKER CAN EMPLOY PRODUCTIVE
FACTORS MOST EFFECTIVELY BY CHOOSING
AND ALLOCATING RESOURCES.
QUALITY OF DICISIONS MAY ALSO BE
IMPROVED. USER BECOMES MORE OBJECTIVE
AND LESS SUBJECTIVE.
PROVIDES PRACTICALLY APPLICABLE
SOLUTIONS
IN PRODUCTION PROCESSES, HIGH LIGHTING
OF BOTTLENECKS IS THE MOST SIGNIFICANT
ADVANTAGE OF THIS TECHNIQUE. FOR
EXAMPLE, WHEN BOTTLENECK OCCUR, SOME
MACHINES CANNOT MEET THE DEMAND WHILE
OTHERS REMAIN IDLE FOR SOME TIME.
 SOLVED PROBLEM 11
A COMPANY MAKING THE COLD DRINKS HAS TWO
BOTTLING PLANTS LOCATED AT TWO TOWN T1 AND T2.
EACH PLANT PRODUCES THREE DRINKS A, B AND C
AND THEIR PRODUCTION CAPACITY PER DAY IS SHOWN
BELOW:
COLD PLANT AT
THE MARKETING
DEPARTMENT OF DRINKS T1 T2
THE COMPANY
FORECASTS A
DEMAND OF 80,000 A 6000 2000
BOTTLES OF A,
22000 BOTTLES OF B B 1000 2500
AND 40000 BOTTLES
C 3000 3000
OF C IN THE MONTH OF JUNE. OPERATING COSTS PER DAY OF PLANT
AT T1 AND T2 ARE BIRR 6000 AND BIRR 4000 RESPECTIVELY. FIND
THE NUMBER OF DAYS FOR WHICH EACH PLANT MUST BE RUN IN
JUNE SO AS TO MINIMISE THE OPERATING COSTS WHILE MEETING
 SOLVED PROBLEM 9
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MAXIMISE Z = 4X1 + 3X2
SUBJECT TO THE CONSTRAINTS
X1 - X2 ≤ - 1
- X1 + X2 ≤ 0
AND X1 ≥ 0, X2 ≥ 0
 SOLVED PROBLEM 6
SOLVE THE GIVEN LPP USING THE GRAPHICAL
METHOD
MAXIMISE Z = 100X1 + 40X2
SUNJECT TO THE CONSTRAINTS
10X1 + 4X2 ≤ 2000
3X1 + 2X2 ≤ 900
6X1 + 12X2 ≤ 3000
AND X1 ≥ 0, X2 ≥ 0
 SOLVED PROBLEM 5
SOLVE THE GIVEN LPP USING THE GRAPHICAL METHOD
MAXIMISE Z = 7X1 + 3X2
SUBJECT TO THE CONSTRAINTS
X1 + 2X2 ≥ 3
X1 + X2 ≤ 4
0 ≤ X1 ≤ 5/2
0 ≤ X2 ≤ 3/2
AND X1 ≥ 0, X2 ≥ 0
 SOLVED PROBLEM 4
BY USING THE GRAPHICAL METHOD, FIND THE MINIMUM
AND MAXIMUM VALUES OF THE FUNCTION Z = X - 3Y
WHERE X AND Y ARE NON - NEGATIVE AND SUBJECT TO
THE FOLLOWING CONDITIONS:

3X + 4Y ≥ 19
2X – Y ≤ 9
2X + Y ≤ 15
X - Y ≥ -3
 SOLVED PROBLEM 3
FOR CONDUCTING A PRACTICAL EXAMINATION, THE
CHEMISTRY DEPARTMENT OF A COLLEGE REQUIRES 10,
12 AND 7 UNITS OF THREE CHEMICALS X, Y, Z
RESPECTIVELY. THE CHEMICALS ARE AVAILABLE IN
TWO TYPES OF BOXES: BOX A, BOX B. BOX A CONTAINS
3, 2, AND 1 UNITS OF X, Y, Z RESPECTIVELY AND COSTS
BIRR 300. BOX B CONTAINS 1, 2, AND 2 UNITS OF X, Y, Z
RESPECTIVELY AND COSTS BIRR 200. FIND HOW MANY
BOXES OF EACH TYPE SHOULD BE BOUGHT BY THE
DEPARTMENT SO THAT THE TOTAL COST IS MINIMAL.