LINEAR PROGRAMMING

-Prof. Subodh Sakpal

Section 1
INTRODUCTION

EVERY ORGANIZATION FACES THE PROBLEM OF ALLOCATION OF RESOURCES

THESE RESOURCES INCLUDE MEN , MACHINE, MATERIAL, CAPITAL, INFORMATION …

MOST OF THESE DECISIONS ARE SUBJECT TO CONSTRAINTS

• MANY OF THE CONTRAINTS CAN BE

AVOIDED BY ADDING MORE
PRODUCTION
ORGANIZATION CAPACITIES, BORROW MORE FUND….
FROM A
FACES WORKING
FACTORY IS • HOWEVER ITS NOT ALWAYS POSSIBLLE
CAPITAL AND TO EXPAND THE RESOUCES ,
LIMITED DUE TO
TECHNICAL THEREFORE OPTIMAL UTILIZATION OF
CAPACITY
CONSTRAINTS EXISTING RESOURCES BECOMES VERY
CONSTRAINTS IMPORTANT TASK FOR THE
ORGANIZATION.
INTRODUCTION
LINEAR PROGRAMMING
• Most popular • Efficient method • Optimal decision • Optimal decision • In short, LP is
and widely used for determining is one that meets can be to concerned with
quantitative an optimal a specified maximize profit the problem of
technique decision chosen objective of or to minimize allocating limited
from a large management cost resources
number of subject to among
possible various competitive
decisions constraints and activities in an
restrictions optimal manner

Production Marketing Company/

Manufacturer Financial Analyst
Manager Manager Organization

Machine Time & Production Investment Allocate a fixed Number of

Labour Hours Schedule & portfolio and Marketing Budget locations of
Maximize the Inventory policy variety of stocks among radio, TV warehouse
Profit Minimize the total Maximize the ROI Maximize the Transportation
product & Advertising cost is reduced
Inventory Cost Effectiveness
DEFINITION OF LINEAR PROGRAMMING

BY KOHLAR BY SAMUELSON BY LOOMBA

• A method of planning and • The analysis of a problem in • LP is only one aspect of what
operation involved in the which linear function if a number has been called a system
construction of a model of a real if variables is to be maximized approach to management
situation containing the or minimized when those wherein all programmes are
following elements variables are subject to a designed and evaluated in
number of restraints in the form terms of their ultimate effects in
i. Variables representing the of linear inequalities. the realisation of business
available choices objectives.
ii. Reflecting the criteria to be
used in measuring the benefits
derivable from each of the
several possible plans
iii. Establishing the objective
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

Decision Well – Presence of

variables Defined Constraints
and their Objective or
relationship Function Restrictions

Alternative Non-
Course of Negative Linearity
Action Restriction
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

• THE DECISION VARIABLES REFER TO

CANDIDATES THAT ARE COMPETING WITH
ONE ANOTHER FOR SHARING THE GIVEN
LIMITED RESOURCES.
Decision
variables • CANDIDATES – PRODUCTS, SERVICES AND
and their PROJECTS
relationship
• THESE VARIABLES ARE USUALLY INTER-
RELATED IN TERMS OF UTILIZATION OF
RESOURCES AND NEED SIMULTANEOUS
SOLUTIONS
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

• A LINEAR PROGRAMMING PROBLEM MUST

HAVE A CLEARLY DEFINED OBJECTIVE
Well –
FUNCTION TO OPTIMIZE WHICH MAY BE
Defined EITHER TO MAXIMIZE CONTRIBUTION BY
Objective UTILIZING AVAILABLE RESOURCES OR IT MAY
Function BE TO PRODUCE AT THE LOWEST POSSIBLE
COSTS BY USING LIMITED AMOUNT OF
PRODUCTIVE FACTORS
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

• THERE MUST BE LIMITATIONS OR

Presence of CONSTRAINTS ON USE OF LIMITED RESOURCES
Constraints (LIKE PRODUCTION CAPACITY, MANPOWER,
or TIME, MACHINES, RAW MATERIAL, SPACE ,
Restrictions LABOUR, MARKETS) WHICH ARE TO BE
ALLOCATED AMONG VARIOUS COMPETITIVE
ACTIVITIES
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

Alternative • IT MUST BE POSSIBLE TO MAKE A SELECTION

Course of BETWEEN VARIOUS COMBINATIONS OF THE
Action PRODUCTIVE FACTORS SUCH AS MENS,
MACHIBES, MATERIALS, MARKETS
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

Non- • ALL DECISION VARIABLES MUST ASSUME NON-

Negative NEGATIVE VALUES AS NEGATIVE VALUES OF
Restriction PHYSICAL QUANTITIES IS AN IMPOSSIBLE
SITUATION
REQUIREMENTS OF LINEAR PROGRAMMING
PROBLEM

• THE BASIC REQUIREMNET OF A LINEAR

PROGRAMMING PROBLEM IS THAT BOTH THE
OBJECTIVES AND CONSTRAINTS MUST BE
EXPRESSED IN TERMS OF LINEAR EQUATIONS
Linearity OR INEQUALITIES

• IF THE NUMBER OF MACHINES IN A PLANT IS

INCREASED, THE PRODUCTION IN THE PLANT
ALSO PROPORTIONATELY INCREASES
BASIC ASSUMPTIONS OF LINEAR PROGRAMMING

WE ASSUME PROPORTIONALITY EXISTS IN THE

OBJECTIVE AND CONSTRAINTS.
PROPORTIONALITY DIVISIBILITY
IF WE NEED TO DOUBLE THE OUTPUT WE
SIMPLY DOUBLE THE REQUIRED RESOURCES.

ADDITIVITY CERTAINTY

FINITENESS
BASIC ASSUMPTIONS OF LINEAR PROGRAMMING

INTERACTION AMONG THE ACTIVITIES OF THE

PROPORTIONALITY DIVISIBILITY RESOURCES DOESNOT EXISTS

ADDITIVITY CERTAINTY

FINITENESS
BASIC ASSUMPTIONS OF LINEAR PROGRAMMING
SOLUTIONS NEED NOT BE IN WHOLE NUMBERS.

INSTEAD THEY ARE DIVISIBLE AND MAKE TAKE

PROPORTIONALITY DIVISIBILITY ANY FRACTIONAL VALUE.

IF A FRACTION OF A PRODUCT CANNOT BE

PRODUCED EG ONE-FOURTH BUS, AN INTEGER
PROGRAMMING PROBLEM EXISTS

ADDITIVITY CERTAINTY

FINITENESS
BASIC ASSUMPTIONS OF LINEAR PROGRAMMING
CO-EFFICIENTS IN THE OBJECTIVE FUNCTION
AND CONSTRAINTS ARE COMPLETELY KNOWN
AND DO NOT CHANGE DURING THE PERIOD
PROPORTIONALITY DIVISIBILITY BEING STUDIED

PROFIT PER UNIT OF EACH PRODUCT, AMOUNT

OF RESOURCES AVAILABLE ARE FIXED

ADDITIVITY CERTAINTY

FINITENESS
BASIC ASSUMPTIONS OF LINEAR PROGRAMMING

AN OPTIMAL NUMBER CANNOT BE COMPUTED

PROPORTIONALITY DIVISIBILITY IN THE SITUATION WHERE THERE ARE INFINITE
NUMBER OF ALTERNATIVE ACTIVITIES AND
RESOURCE RESTRICTIONS.

ADDITIVITY CERTAINTY

FINITENESS
APPLICATION AREAS OF LINEAR PROGRAMMING…
INDUSTRIAL MANAGEMENT
Product Mix -Problem Portfolio Selection
Production Smoothing Problem Financial Mix Strategy
Blending Problem Profit Planning
Production Scheduling Media Selection problem
Trim-Loss Manpower Planning
Oil Refineries Right Person for the Right Job
Communication Industry Travelling Salesman Problem
Rail-Road Industry A Make or Buy Problem
Finding least cost shipping
arrangement from plant to
customer
APPLICATION AREAS OF LINEAR PROGRAMMING…
MISCELLANEOUS ADMINISTRATIVE NON-INDUSTRIAL
Farm Planning Departmental Staff Agriculture
Airline Route Work Distribution among Environment
Staff
Administration, Education Urban Department
& Politics
Diet Problems Facilities, Location
EXERCISE
Problem Type Objective Decision Variables Constraints
To select the mix of How much to produce 1. Market – Max amount of each product or
products or services that and market of each service demanded
Product Mix results in maximum profits product or service for 2. Capacity – Max amount of resources
for the planning period the planning period?
available
To select the mix of How much of each 1. Market – Amount of Final product demanded
ingredients going into final raw material or
products that results in ingredients to use in 2. Capacity – Max amount of Ingredient processing
Ingredient Mix minimum operating costs the planning period? available
for the planning period 3. Technology – Relationship between Ingredients
and Final products
To determine a minimum How much units of 1. Nutrients – The minimum daily
Diet cost of diet different food items
be included in a diet? requirements of each nutrient

To select the distribution How much product to

plan from sources to ship from each 1. Destination – Minimum or exact amount of
Transportation destinations that results in sources to each product required for each destination
minimum shipping costs destination for the 2. Source Capacity – Exact or maximum
for the panning period planning period?
amount of products available at each source
SOLVING LINEAR PROGRAMMING PROBLEMS
-Prof. Subodh Sakpal
Section 2
EXAMPLE OF PRODUCT MIX PROBLEMS
• RAJA FURNITURE FACTORY PRODUCES INEXPENSIVE TABLES AND CHAIRS.

• PRODUCTION PROCESS ON BOTH ARE SIMILAR IN THE SENSE THAT BOTH REQUIRE A CERTAIN NUMBER OF CARPENTRY
WORK AND A CERTAIN NUMBER OF LABOUR HOURS IN THE PAINTING DEPARTMENT.

• EACH TABLE TAKES 4 HOURS IN CARPENTRY AND 2 HOURS IN PAINTING DEPARTMENT.

• EACH CHAIR TAKES 3 HOURS IN CARPENTRY AND 1 HOURS IN PAINTING DEPARTMENT.

• DURING THE CURRENT PRODUCTION PERIOD ONLY 300 HOURS OF CARPENTRY TIME AND 120 HOURS OF PAINTING
TIME ARE AVAILABLE

• EACH TABLE SOLD YIELDS A PROFIT OF RS 70 AND EACH CHAIR PRODUCED MAY BE SOLD FOR A PROFIT OF RS. 50

Raja furniture factory now wants to determine the best possible combination of tables and chairs to manufacture in
order to get the maximum profit. Assuming that any mix of tables and chairs could be sold, the manufacturer would
like this production mix situation to be formulated as a linear programming problem
Raja Furniture factory problem data:

Resource/Constraints Hours required to produce 1 unit Available Hours

Tables Chairs
Carpentry 4 3 300
Painting 2 1 120
Profit contribution (Rs./unit) 70 50

STEP 1: Identify the decision variables

The unknown activities to be determined are the rate of production for the two types of furniture

X1 = number of tables to be produced

X2 = number of chairs to be produced

STEP 2: To develop mathematical relationships to describe the two constraints in this problem

Carpentry time used <= Carpentry time available

Painting time used <= Painting time available
STEP 2: …

(4 hrs./table)*(Nos of tables produced) + (3 hrs./chair)*(Nos of chairs produced)

4X1 + 3X2 <= 300 (Hours of Carpentry Time)

(2 hrs./table)*(Nos of tables produced) + (1 hrs./chair)*(Nos of chairs produced)

2X1 + 1X2 <= 120 (Hours of Painting Time)

STEP 3: Since firm cannot produce negative number of units of any type of furniture, X1 >= 0
And X2>=0

STEP 4: Identify the Objective Function. The Objective is to maximize the total profit
Z = 70X1 + 50X2
The appropriate formulation of the given problem as LP format is:

Maximize (total profit) Z = 70X1 + 50X2

Subject to the constraints
4X1 + 3X2 <= 300
2X1 + 1X2 <= 120
X1 >= 0, X2>=0
EXAMPLE OF DIET PROBLEMS

• VITAMIN V AND W ARE FOUND IN TWO DIFFERENT FOODS F1 AND F2.

• ONE UNIT OF FOOD F1 CONTAINS 2 UNITS OF VITAMIN V AND 5 UNITS OF VITAMIN W

• ONE UNIT OF FOOD F2 CONTAINS 4 UNITS OF VITAMIN V AND 2 UNITS OF VITAMIN W

• ONE UNIT OF FOOD F1 AND F2 COST RS. 30 AND 25 RESPECTIVELY

• THE MINIMUM DAILY REQUIREMENT FOR A PERSON OF VITAMIN V AND VITAMIN W IS 40 AND 50 UNITS RESPECTIVELY.

Assuming that anything excess of daily minimum requirement of vitamin V and W is not harmful, find out the optimal
mixture of food F1 and F2 at the minimum cost which meets the daily minimum requirements of vitamins V and W.
Formulate This As A Linear Programming Problem
Tabular data:
Resource/Constraints Food Minimum Daily
Requirement
F1 F2
Vitamin V (units) 2 4 40
Vitamin W (units) 5 2 50
Cost per unit 30 25

STEP 1: Identify the decision variables

X1 = To meet the daily requirement of vitamins V

X2 = To meet the daily requirement of vitamins W

STEP 2: Constraints in this problem

2X1 + 4X2 >=40

5X1 + 2X2 >=50
STEP 3: X1 >= 0 And X2>=0

STEP 4: Identify the Objective Function. The Objective is to minimize the total cost
Z = 30X1 + 25X2

The appropriate formulation of the given problem as LP format is:

Minimize (total cost) Z = 30X1 + 25X2

Subject to the constraints
2X1 + 4X2 >=40
5X1 + 2X2 >=50
X1 >= 0, X2>=0
EXERCISE
• A COMPANY HAS THREE OPERATIONAL DEPARTMENTS – WEAVING, PROCESSING AND PACKAGING WITH CAPACITY TO
PRODUCE 3 DIFFERENT TYPES OF CLOTHES NAMELY SUITINGS, SHIRTINGS AND WOOLENS YIELDING THE PROFIT RS 2,
RS 4 AND RS 3 PER METER RESPECTIVELY

• 1 METER SUITING REQUIRES 3 MINUTES IN WEAVING, 2 MINUTES IN PROCESSING AND 1 MINUTE IN PACKAGING
• 1 METER SHIRTING REQUIRES 4 MINUTES IN WEAVING, 1 MINUTES IN PROCESSING AND 3 MINUTE IN PACKAGING
• 1 METER WOOLLEN REQUIRES 3 MINUTES IN EACH DEPARTMENT

• IN A WEEK TOTAL RUN TIMES OF DEPARTMENT ARE 60, 40 AND 80HOURS OF WEAVING, PROCESSING AND PACKAGING
DEPARTMENTS RESPECTIVELY

Formulated the linear programming problem to find the product mix to maximize the profit
Data of the problem is summarized as follow:
Resources/Constraints Product Total Availability
(Minutes)
Suiting Shirting Woollen
Weaving Department 3 4 3 60*60
Processing Department 2 1 3 40*60
Packaging Department 1 3 3 80*60
Contributions per metre (Rs). 2 4 3

STEP 1: Identify the decision variables

The unknown activities to be determined are the weekly rate of production for the three type of
clothes
X1 = Weekly production of Suitings X3 = Weekly production of Woollens
X2 = Weekly production of Shirtings

STEP 2: Constraints in this problem

Weaving Department Constraints: 3X1 + 4X2 + 3X3 <= 3600
Processing Department Constraints: 2X1 + 1X2 + 3X3 <= 2400
Packaging Department Constraints: 1X1 + 3X2 + 3X3 <= 4800
STEP 3: We restrict the variables X1, X2 and X3 to non-negative values, the variables must satisfy
the non-negativity constraints
X1 >= 0, X2>=0 and X3>=0

STEP 4: Identify the Objective Function. The Objective is to minimize the total cost
Z = 2X1 + 4X2 + 3X3

The appropriate formulation of the given problem as LP format is:

Maximize Z = 2X1 + 4X2 + 3X3

Subject to the constraints
3X1 + 4X2 + 3X3 <= 3600
2X1 + 1X2 + 3X3 <= 2400
1X1 + 3X2 + 3X3 <= 4800
X1 >= 0, X2>=0
SOLVING MORE COMPLEX LINEAR
PROGRAMMING PROBLEMS
-Prof. Subodh Sakpal
Section 3
EXAMPLE OF MAN POWER SCHEDULE
• A 24-SUPERMARKET HAS THE FOLLOWING MINIMAL REQUIREMENTS FOR THE STAFF

STAFFING REQUIREMNET SHIFT SCHEDULE

Minimum Number Shift Start Time End Time
Time of Day
OF STAFF Required 1 MIDNIGHT 8 AM
Midnight – 4 AM 7 2 4 AM NOON
4 AM – 8 AM 20 3 8 AM 4 PM
8 AM – NOON 14 4 NOON 8 PM
NOON – 4 PM 20
5 4 PM MIDNIGHT
4 PM – 8 PM 10
6 8 PM 4 AM
8 PM - MIDNIGHT 5

• SHIFT 1 FOLLOWS IMMEDIATELY AFTER SHIFT 6.

• AN OFFICER WORKS EIGHT CONSECUTIVE HOURS, STARTING AT THE BEGINNING OF ONE OF THE SIX PERIODS.
• THE PERSONNEL MANAGER WANTS TO DETREMINE HOW MANY OFFICERS SHOULD WORK EACH SHIFT IN ORDER TO
MINIMIZE THE TOTAL NUMBER OF OFFICERS EMPLOYED WHILE STILL SATISFYING THE STAFFINNG REQUIREMENTS.
• FORMULATE THE PROBLEM AS A LINEAR PROGRAMMING PROBLEM
STEP 1: Identify the decision variables
X1 – Numbers of Staff working shift 1
X2 – Numbers of Staff working shift 2
X3 – Numbers of Staff working shift 3
X4 – Numbers of Staff working shift 4
X5 – Numbers of Staff working shift 5
X6 – Numbers of Staff working shift 6
STEP 2: Constraints in this problem
Shift MIDNIGHT 4 AM – 8 AM 8 AM – NOON NOON – 4 PM 4 PM – 8 PM 8 PM -
TO 4 AM MIDNIGHT
1 X1 X1
2 X2 X2
3 X3 X3
4 X4 X4
5 X5 X5
6 X6 X6
Requirements 7 20 14 20 10 5
STEP 2: Constraints in this problem
X1 + X6 >= 7
X1 + X2 >= 20
X2 + X3 >= 14
X3 + X4 >= 20
X4 + X5 >= 10
X5 + X6 >= 5

STEP 3: We restrict the variables X1, X2, X3, X4, X5, X6 to non-negative values, the variables must
satisfy the non-negativity constraints
X1 >= 0, X2>=0, X3>=0, X4 >= 0, X5>=0, X6>=0
STEP 4: Identify the Objective Function. The Objective is to minimize the staff
Z = X1 + X2 + X3 + X4 + X5 + X6
The appropriate formulation of the given problem as LP format is:
Minimize Z = X1 + X2 + X3 + X4 + X5 + X6
Subject to the constraints
X1 + X6 >= 7 X1 + X2 >= 20
X2 + X3 >= 14 X3 + X4 >= 20
X4 + X5 >= 10 X5 + X6 >= 5
X1 >= 0, X2>=0, X3>=0, X4 >= 0, X5>=0, X6>=0
EXAMPLE OF BLENDING PROBLEM
• THE MANAGER OF AN OIL REFINERY MUST DECIDE ON THE OPTIMUM MIX OF TWO POSSIBLE BLENDING PROCESSES
OF WHICH THE INPUTS AND OUTPUTS PER PRODUCTION RUN IS AS FOLLOWS

INPUT PROCESS OUTPUT

GRADE A GRADE B GASOLINE X GASOLINE Y
6 4 1 6 9
5 6 2 5 5

• THE MAXIMUM AMOUNTS AVAILABLE OF CRUDES A AND B ARE 250UNITS AND 200UNITS RESPECTIVELY
• MARKET DEMAND SHOWS THAT AT LEAST 150 UNITS OF GASOLINE X AND 130 UNITS OF GASOLINE Y MUST BE
PRODUCED
• THE PROFIT PER PRODUCTION RUN FOR PROCESS 1 AND PROCESS 2 ARE RS 400 AND RS 500 RESPECTIVELY.
• FORMULATE THE PROBLEM FOR MAXIMIZING THE PROFIT
STEP 1: Identify the decision variables
IT IS DESIRED TO DETERMINE THE QUANTITIES OF GASOLINE TO BE PRODUCED BY THE TWO
BLENDING PROCESS

X1 = NUMBER OF PRODUCTION RUN OF PROCESS 1

X2 = NUMBER OF PRODUCTION RUN OF PROCESS 2

STEP 2: Constraints in this problem

Crude Availability
6X1 + 5X2 <= 250
4X1 + 6X2 <= 200
Market Demand
6X1 + 5X2 >= 150
9X1 + 5X2 >= 130
STEP 3: X1 >= 0 And X2>=0
STEP 4: Identify the Objective Function. The Objective is to maximize the profit
Z = 400X1 + 500X2
The appropriate formulation of the given problem as LP format is:
Maximize Z = 400X1 + 500X2
Subject to the constraints
6X1 + 5X2 <= 250
4X1 + 6X2 <= 200
6X1 + 5X2 >= 150
9X1 + 5X2 >= 130

X1 >= 0, X2>=0
LINEAR PROGRAMMING – GRAPHICAL
SOLUTION PROBLEM
-Prof. Subodh Sakpal
Section 4
ADVANTAGES OF LINEAR PROGRAMMING
Advantages

Helps in re-evaluation of
Optimum Use of Improves the Possible and Highlights the bottleneck
a basic plan for changing
Productive Resource Quality of Decision Practical Solutions in the Process
condition
LIMITATIONS OF LINEAR PROGRAMMING
Limitations

Treats relationship No guarantee of Does not take into Parameters appearing Need to fragment the
It deals only with
between all decision integer value consideration the effect in the model are problem in several
variables as linear solutions of time and uncertainty assumed to e constant single objective small problems
GRAPHICAL SOLUTION METHODS OF LP PROBLEMS
It is the approach of finding the optimal solution to an LP problem by testing the profit or
cost value of the objective function at each corner point of the feasible region.

STEP 1 – DEVELOP AN LP MODEL

STEP 2 – PLOT CONSTRAINTS ON GRAPH PAPER AND DECIDE THE FEASIBLE REGION

STEP 3 – EXAMINE EXTREME POINTS(CORNERS) OF THE FEASILE SOLUTION SPACE

Determine the co- Determine the extreme

ordinates of each Evaluate the value of point of the feasible
corner(extreme) points Objective Function (Z) at region that has
of the area of feasible each extreme points optimum(best) objective
region function value
EXAMPLE
• USE THE GRAPHICAL METHOD TO SOLVE THE FOLLOWING LP PROBLEM
• Maximize Z = 15X1 + 10X2
• Subject to the constraints

• 4X1 + 6X2 <=360

• 3X1 + 0X2 <=180
• 0X1 + 5X2 <=200
• X1 >= 0 And X2>=0
1st constraint:

4X1 + 6X2 <=360

Consider X1 = 0 then
4(0) + 6X2 = 360
6X2 = 360
X2 = 60

Consider X2 = 0 then
4X1 + 6(0) = 360
4X1 = 360
X1 = 90

So co-ordinates are (90, 0) & (0, 60)

2nd constraint:

3X1 + 0X2 <=180

Then 3X1 = 180
So X1 = 60
Co-ordinates are (60, 0)
3rd constraint:

0X1 + 5X2 <=200

Then 5X2 = 200
So X2 = 40
Co-ordinates are (0, 40)
4th constraint:
X1 >= 0 And X2>=0 so Co-ordinates are (0, 0)
Final co-ordinates are:

(90, 60)
(60, 0)
(0, 40)
(0, 0)
 Final co-ordinates are:

X2 (90, 60)
(60, 0)
(0, 40)
80
(0, 0)
60

40

20

X1
0, 0 20 40 60 80 100
 Final co-ordinates are:

X2 (90, 60)
(60, 0)
(0, 40)
80
(0, 0)
60

40

20

X1
0, 0 20 40 60 80 90 100
 X2

80

60

40

20

X1
0, 0 20 40 60 80 90 100
 X2

80

60

40

20

X1
0, 0 20 40 60 80 90 100
 X2 O, A, B, C and D are our extreme points

80

60

D C
40

B
20

O A
X1
0, 0 20 40 60 80 90 100
 X2

80 So our feasible region is OABCD

60

D C
40

B
20

O A
X1
0, 0 20 40 60 80 90 100
 Co-ordinates of extreme points are

X2 O (0, 0)
A (60, 0)
B (60, 20)
80
C (30, 40)
60
D (0, 40)

D C
40

B
20

O A
X1
0, 0 20 40 60 80 90 100
CALCULATE Z
Extreme Points Co-ordinates Objective Function Value
Z = 15X1 + 10X2
O (0, 0) 15 (0) + 10 (0) = 0
A (60, 0) 15 (60) + 10 (0) = 900
B (60, 20) 15 (60) + 10 (20) = 1100
C (30, 40) 15 (30) + 10 (40) = 850
D (0, 40) 15 (0) + 10 (40) = 400

We conclude that Maximum Value of Z = 1100 which is achieved at

point B (60, 20). Hence the optimal solution to the given LP problem is
X1 = 60 and X2 = 20 and Max Z = 1100