Operations Research

BMC 515

Manu K. Gupta
Department of Management Studies,

IIT Roorkee.

Session 2
Last lecture

• Course Outline
• Burrito Optimization Game
• Product Mix problems

1
Product mix problem in a sweets shop.

Prakash sweets in Roorkee can make two types of sweets (A and B).
They use two flour and sugar to make A and B.

• One packet of A needs 3kg of flour and 3kg of sugar.

• One packet of B needs 3kg of flour and 4kg of sugar.

Prakash Sweets has 21 kg of flour and 28 kg of sugar. These sweets are

sold at profit of Rs 100 and 90 per packet respectively. Find the best
product mix.

2
Product mix problem in a sweets shop.

Prakash sweets in Roorkee can make two types of sweets (A and B).
They use two flour and sugar to make A and B.

• One packet of A needs 3kg of flour and 3kg of sugar.

• One packet of B needs 3kg of flour and 4kg of sugar.

Prakash Sweets has 21 kg of flour and 28 kg of sugar. These sweets are

sold at profit of Rs 100 and 90 per packet respectively. Find the best
product mix.

Can you formulate this problem as a mathematical program?

2
Mathematical Programming formulation

1. First, define your decision variables.

3
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of packet A and B that you
would like to produce. Give mathematical notations to these
variables.

3
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of packet A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:

3
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of packet A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the availability of flour and sugar along with the
requirements to produce packet A and B. Express them
mathematically.

3
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of packet A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the availability of flour and sugar along with the
requirements to produce packet A and B. Express them
mathematically.
3. Finally, write the objective function:

3
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of packet A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the availability of flour and sugar along with the
requirements to produce packet A and B. Express them
mathematically.
3. Finally, write the objective function:
• ‘Objective function’ is the ultimate objective that you have. It is
against this objective that the optimal decision variables are to be
calculated. In this case, the objective is to maximize the profit.
Write it mathematically.
3
Mathematical Programming Formulation

Decision Variables:
xA : The number of packets to be made of type A
xB : The number of packets to be made of type B

max 100xA + 90xB

Subject to:

3xA + 3xB ≤ 21 (1)

3xA + 4xB ≤ 28 (2)
xA ≥ 0, xB ≥ 0

4
Mathematical Programming Formulation

Decision Variables:
xA : The number of packets to be made of type A
xB : The number of packets to be made of type B

max 100xA + 90xB

Subject to:

3xA + 3xB ≤ 21 (1)

3xA + 4xB ≤ 28 (2)
xA ≥ 0, xB ≥ 0

Let’s solve it using graphical method.

4
Demo using Geogebra

max x +y
Subject to:

2x − y ≤ 4 (3)
x + 2y ≤ 4 (4)
2x + y ≥ 1 (5)
x ≥ 0, y ≥ 0

5
Demo using Geogebra

max x +y
Subject to:

2x − y ≤ 4 (3)
x + 2y ≤ 4 (4)
2x + y ≥ 1 (5)
x ≥ 0, y ≥ 0

Demo Link: https://www.geogebra.org/m/pcx324hc

5
Production Planning Problem1

Please read the problem statement.

Figure 1: Production planning problem

1 Source: https://medium.com/@rahulpandey.igsa/
opining- on-optimization- 1- a- simple- production- planning- problem- to-learn- first- steps- of- modeling- ccaf6369bf2f

6
Mathematical Programming formulation

1. First, define your decision variables.

7
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of products A and B that you
would like to produce. Give mathematical notations to these
variables.

7
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of products A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:

7
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of products A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the commitments of suppliers and capacity limits
of operations. Express them mathematically.

7
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of products A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the commitments of suppliers and capacity limits
of operations. Express them mathematically.
3. Finally, write the objective function:

7
Mathematical Programming formulation

1. First, define your decision variables.

• ‘Decision variables’ are the parameters that you want the model to
decide. In this case, it is the quantities of products A and B that you
would like to produce. Give mathematical notations to these
variables.
2. Then, write down system constraints:
• Then, write down system constraints:‘System constraints’ are the
relationships between different variables that specify various
constraints/limits or other characteristics of the system. In this case,
the constraints are the commitments of suppliers and capacity limits
of operations. Express them mathematically.
3. Finally, write the objective function:
• ‘Objective function’ is the ultimate objective that you have. It is
against this objective that the optimal decision variables are to be
calculated. In this case, the objective is to maximize the profit.
Write it mathematically.

7
Linear Programming Formulation

Decision Variables:
x1 : The number of units to be made of type A
x2 : The number of units to be made of type B

max 2x1 + 3x2

Subject to:

x1 ≤ 4000 (6)
x2 ≤ 3500 (7)
x1 + x2 ≤ 5000 (8)
x1 x2
+ ≤ 1 (9)
8000 4000
x1 ≥ 0,
x2 ≥ 0

8
Linear Programming Formulation

Decision Variables:
x1 : The number of units to be made of type A
x2 : The number of units to be made of type B

max 2x1 + 3x2

Subject to:

x1 ≤ 4000 (6)
x2 ≤ 3500 (7)
x1 + x2 ≤ 5000 (8)
x1 x2
+ ≤ 1 (9)
8000 4000
x1 ≥ 0,
x2 ≥ 0

8
Fact

Solution of an linear program always lie in the corner point!

Ques: Will it happen for non-linear program?

9
Fact

Solution of an linear program always lie in the corner point!

Ques: Will it happen for non-linear program?

Ans: No

9
Fact

Solution of an linear program always lie in the corner point!

Ques: Will it happen for non-linear program?

Ans: No

Ques: Can you come up with an example of non-linear program where

the solution doesn’t lie in the corner point?

9
min x12 + x22 − 4x1 − 6x2
x1 ,x2

x1 + x2 ≥ 5 (10)
x1 ≥ 0 (11)
x2 ≥ 0 (12)

10
11
Maximize z = 60x1 − 5x12 + 80x2 − 4x22
subject to:
6x1 + 5x2 ≤ 60,
10x1 + 20x2 ≤ 150,
x1 ≤ 8,
x1 ≥ 0,
x2 ≥ 0.

12
Click here for interactive visualization.

13
14
 Thank you!
[email protected]

14