Example 6: Diet Problem

• A person wants to decide the constituents

of a diet
• To fulfil his daily requirements of proteins,
fats and carbohydrates at the minimum
cost
• Choice is to be made from four different
types of food
• The yields per unit of these foods are
given in the table
© 2015 McGraw-Hill Education. All rights reserved. 1
Example 6: Diet Problem

• Formulate LP model for the problem

Food Type Yield per unit Cost
per
unit
Protein Fats Carbohydrates
1. 3 2 6 45
2. 4 2 4 40
3. 8 7 7 85
4. 6 5 4 65
Minimum 800 200 700
Requirement
© 2015 McGraw-Hill Education. All rights reserved. 2
Example 6: Diet Problem

• Xj: Quantity of food type ‘j’ Decision Variables

Objective Function: Minimize Total Diet Cost

Minimize Z = 45 X1 + 40 X2 + 85 X3 + 65 X4
St. 3 X1 + 4 X2 + 8 X3 + 6 X4 ≥ 800
Constraints
2 X1 + 2 X2 + 7 X3 + 5 X4 ≥ 200
6 X1 + 4 X2+ 7 X3 + 4 X4 ≥ 700
Xj ≥ 0 Non-negativity Constraints

© 2015 McGraw-Hill Education. All rights reserved. 3

© 2015 McGraw-Hill Education. All rights reserved. 4
Example 7: Advertising Problem

• An advertising company wishes to plan its

advertising strategy in 3 different media:
TV, radio and magazines
• The purpose is to reach a large number of
potential customers
• Following data has been obtained from
market survey

© 2015 McGraw-Hill Education. All rights reserved. 5

Example 7: Advertising Problem

• Formulate LP model for the problem

Strategy Types of Media
TV Radio Magazine 1 Magazine 2

Cost of an 30,000 20,000 15,000 10,000

advertising unit
Number of 2,00,000 6,00,000 1,50,000 1,00,000
Potential
Customers
Reached per unit
Number of Female 1,50,000 4,00,000 70,000 50,000
Customers
Reached per unit

© 2015 McGraw-Hill Education. All rights reserved. 6

Example 7: Advertising Problem

• The company wants to spend not more than

Rs. 4,50,000 on advertising
• At least 1 million exposures should take place
among female customers
• Advertising on magazines must be limited to
Rs. 1,50,000
• At least 3 advertising units to be bought of
magazine 1 and 2 units of magazine 2
• The number of advertising units on TV and
radio should each be between 5 and 10
• Formulate a LP model for the problem
© 2015 McGraw-Hill Education. All rights reserved. 7
Example 7: Advertising Problem

• Xj: Number of units bought using media type ‘j’

Decision Variables
• Objective Function: Maximize Potential
Customers Reach
Maximize Z = 2,00,000 X1 + 6,00,000 X2 +
1,50,000 X3 + 1,00,000 X4
St. 30,000 X1 + 20,000 X2 + 15,000 X3 +
10,000 X4 ≤ 4,50,000
1,50,000 X1 + 4,00,000 X2 + 70,000 X3
+ 50,000 X4 ≥ 10,00,000 Constraints
© 2015 McGraw-Hill Education. All rights reserved. 8
Example 7: Advertising Problem

15,000 X3 + 10,000 X4 ≤ 1,50,000

X3 ≥ 3
Constraints
X4 ≥ 2
5 ≤ X1 ≤ 10
5 ≤ X2 ≤ 10
Xj ≥ 0 Non-negativity Constraints

© 2015 McGraw-Hill Education. All rights reserved. 9

© 2015 McGraw-Hill Education. All rights reserved. 10
Assumptions of Linear Programming

• Additivity
– Every function in a linear programming model
is the sum of the individual contributions of
the activities
• Divisibility
– Decision variables in a linear programming
model may have any values
• Including noninteger values
– Assumes activities can be run at fractional
values
© 2015 McGraw-Hill Education. All rights reserved. 11
Assumptions of Linear Programming

• Proportionality assumption
– The contribution of each activity to the value
of the objective function (or left-hand side of a
functional constraint) is proportional to the
level of the activity

– If assumption does not hold, one must use

nonlinear programming techniques

© 2015 McGraw-Hill Education. All rights reserved. 12

Assumptions of Linear Programming

• Certainty
– Value assigned to each parameter of a linear
programming model is assumed to be a
known constant

– Seldom satisfied precisely in real applications

• Sensitivity analysis used

© 2015 McGraw-Hill Education. All rights reserved. 13

Product Mix Problem

Maximize 𝑍 = 6 𝑥1 + 5𝑥2
Subject to
𝑥1 + 𝑥2 ≤ 5
3𝑥1 + 2𝑥2 ≤ 12
𝑥1 ≥ 0
𝑥2 ≥ 0

© 2015 McGraw-Hill Education. All rights reserved. 14

The Linear Programming Model

Steps in Graphical Solution Method

• Plot the constraints on a graph by eliminating
inequality sign and assuming arbitrary values for DV’s

• Restrict yourself to the first quadrant where both the

decision variables (𝒙𝟏, 𝒙𝟐 ) are ≥ zero to fulfil the non-
negativity requirement

• Identify the feasible region that contain the set of

points satisfying all the constraints

© 2015 McGraw-Hill Education. All rights reserved. 15

The Linear Programming Model

Steps in Graphical Solution Method

• Identify corner points

• Evaluate the objective function at all the corner

points

• The corner point that has the best value of the

objective function (max/min) is optimal

© 2015 McGraw-Hill Education. All rights reserved. 16

© 2015 McGraw-Hill Education. All rights reserved. 17
© 2015 McGraw-Hill Education. All rights reserved. 18
© 2015 McGraw-Hill Education. All rights reserved. 19
© 2015 McGraw-Hill Education. All rights reserved. 20
Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0

(0, 5) A

𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O E
(5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 21

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A

𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 22

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A

𝑭𝒆𝒂𝒔𝒊𝒃𝒍𝒆 𝑹𝒆𝒈𝒊𝒐𝒏 𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 23

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A
C (2, 3)
𝑭𝒆𝒂𝒔𝒊𝒃𝒍𝒆 𝑹𝒆𝒈𝒊𝒐𝒏 𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 24

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A
C (2, 3) 𝑶𝒑𝒕𝒊𝒎𝒖𝒎/𝑶𝒑𝒕𝒊𝒎𝒂𝒍 Solution
𝑭𝒆𝒂𝒔𝒊𝒃𝒍𝒆 𝑹𝒆𝒈𝒊𝒐𝒏 𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 25

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A
C (2, 3) 𝑶𝒑𝒕𝒊𝒎𝒖𝒎/𝑶𝒑𝒕𝒊𝒎𝒂𝒍 Solution
𝑭𝒆𝒂𝒔𝒊𝒃𝒍𝒆 𝑹𝒆𝒈𝒊𝒐𝒏 𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)

© 2015 McGraw-Hill Education. All rights reserved. 26

Product Mix Problem
1.) Graphical Solution Method
𝑥1 0 5
𝑥2 Constraint 1
𝑥2 5 0
𝑥1 0 4
Constraint 2
𝑥2 6 0

(0, 6) B 3𝑥1 + 2𝑥2 = 12

(0, 5) A
C (2, 3) 𝑶𝒑𝒕𝒊𝒎𝒖𝒎/𝑶𝒑𝒕𝒊𝒎𝒂𝒍 Solution
𝑭𝒆𝒂𝒔𝒊𝒃𝒍𝒆 𝑹𝒆𝒈𝒊𝒐𝒏 𝑥1 + 𝑥2 = 5

𝑥1
(0, 0) O D E
(4, 0) (5, 0)
𝑰𝒔𝒐 𝑷𝒓𝒐𝒇𝒊𝒕 𝑳𝒊𝒏𝒆𝒔
© 2015 McGraw-Hill Education. All rights reserved. 27
The Linear Programming Model

A LP problem involving only two decision

variables can be solved using a graphical solution
method
• Feasible Region
– It includes every solution point that satisfies
all the constraints
• Corner Points/Extreme Points
– Corner points of the feasible region is referred
to as the extreme points

© 2015 McGraw-Hill Education. All rights reserved. 28

The Linear Programming Model

• Feasible solution
– Solution for which all constraints are satisfied
– Might not exist for a given problem
• Infeasible solution
– Solution for which at least one constraint is
violated
• Optimum/Optimal solution
– Has most favorable value of objective function
– Might not exist for a given problem
© 2015 McGraw-Hill Education. All rights reserved. 29
The Linear Programming Model

• No need to evaluate all feasible solution points.

In fact, consider only the feasible solutions that
occur at the extreme points of the feasible
region.

• The optimal solution is found by evaluating the

four extreme-point solutions for the problem
represented by ‘OACD’ and selecting the one
that provides the largest profit contribution.

© 2015 McGraw-Hill Education. All rights reserved. 30

The Linear Programming Model

• Corner-point feasible (CPF) solution

– Solution that lies at the corner of the feasible
region
• Linear programming problem with feasible
solution and bounded feasible region
– Must have CPF solutions and optimal
solution(s)
– Best CPF solution must be an optimal solution

© 2015 McGraw-Hill Education. All rights reserved. 31