Gipe Moduel 9 Lpp1

GIPE
OR Sessions Questions
Module-9
Common terminologies used in Linear Programming

Let us define some terminologies used in Linear Programming using the above example.
 Decision Variables: The decision variables are the variables that will decide my
output. They represent my ultimate solution. To solve any problem, we first need
to identify the decision variables. For the above example, the total number of
units for A and B denoted by X & Y respectively are my decision variables.
 Objective Function: It is defined as the objective of making decisions. In the
above example, the company wishes to increase the total profit represented by Z.
So, profit is my objective function.
 Constraints: The constraints are the restrictions or limitations on the decision
variables. They usually limit the value of the decision variables. In the
above example, the limit on the availability of resources Milk and Choco are my
constraints.
 Non-negativity restriction: For all linear programs, the decision variables
should always take non-negative values. This means the values for decision
variables should be greater than or equal to 0.
***********************************************************
Example:1: Consider a chocolate manufacturing company that produces only
two types of chocolate – A and B. Both the chocolates require Milk and Choco
only. To manufacture each unit of A and B, the following quantities are required:
 Each unit of A requires 1 unit of Milk and 3 units of Choco

 Each unit of B requires 1 unit of Milk and 2 units of Choco
The company kitchen has a total of 5 units of Milk and 12 units of Choco. On each sale,
the company makes a profit of
 Rs 6 per unit A sold

 Rs 5 per unit B sold.
Now, the company wishes to maximize its profit. How many units of A and B should it
produce respectively?
Solution: The first thing I’m gonna do is represent the problem in a tabular form for
better understanding.
Milk Choco Profit per unit

A 1 3 Rs 6
B 1 2 Rs 5
Total 5 12

Let the total number of units produced by A be = X
Let the total number of units produced by B be = Y
Now, the total profit is represented by Z
The total profit the company makes is given by the total number of units of A and B
produced multiplied by its per-unit profit of Rs 6 and Rs 5 respectively.
Example 2:Three nutrient components namely, thiamin, phosphorus and iron are
found in a diet of two food items - A and B. The amount of each nutrient (in
milligrams per ounce, i.e., mg/oz) is given below:
Nutrient Food Item
A B
Thiamin 0.12 mg/oz 0.10 mg/oz
Phosphorus 0.75 mg/oz 1.70 mg/oz
Iron 1.20 mg/oz 1.10 mg/oz

The cost of food items A and B is Rs. 2 per oz and Rs. 1.70 per oz respectively. The
minimum daily requirements of these nutrients are atleast 1.00 mg of thiamin, 7.50
mg of phosphorus, and 10.00 mg of iron. Formulate this problem in the linear
programming (LPP) form. Let x 1 and x2 be the number of units (ounces) of A and B
respectively. The objective here is to minimize the total cost of the food items, which
is given by the linear function
Minimize z = 2x1 + 1.7x2

0.12x1 +0.10x2 ≥1.0
0.75x1 +1.70x2 ≥7.5
1.20x1 + 1.10x2 ≥ 10.0
x1 ≥ 0, x2 ≥ 0
Example:3: Below there is a diet chart that gives me calories, protein, carbohydrate and
fat content for 4 food items. Sara wants a diet with minimum cost. The diet chart is as
follows:
Food Item 1 Food Item 2 Food Item 3 Food Item 4

Calories 400 200 150 500
Protien (in grams) 3 2 0 0
Carbohydrates ( in grams) 2 2 4 4
Fat (in grams) 2 4 1 5
Cost $0.50 $0.20 $0.30 $0.80
The chart gives the nutrient content as well as the per-unit cost of each food item. The
diet has to be planned in such a way that it should contain at least 500 calories, 6 grams
of protein, 10 grams of carbohydrates and 8 grams of fat.
Example:4: A farmer has recently acquired a 110 hectares piece of land. He has
decided to grow Wheat and barley on that land. Due to the quality of the sun and the
region’s excellent climate, the entire production of Wheat and Barley can be sold. He
wants to know how to plant each variety in the 110 hectares, given the costs, net profits
and labor requirements according to the data shown below:
Variety Cost (Price/Hec) Net Profit (Price/Hec) Man-days/Hec

Wheat 100 50 10
Barley 200 120 30
The farmer has a budget of US$10,000 and availability of 1,200 man-days during the
planning horizon. Find the optimal solution and the optimal value.
Example 5 - Blending Problem
The manger of Deep Sea Oil Refinery must decide on the optimal mix of two
possible blending processes of which the inputs and outputs per production run are
given in the following table:
Process Input (units) Output (units) Profit
Crude P Crude Q Gasoline S Gasoline T
A 6 2 6 8 400
B 3 6 4 5 500
Total 300 250 120 100

availabilities
Formulate the blending problem as a linear programming (LPP) problem.
Let x1 and x2 be the number of production runs of process A & B respectively. The
objective here is to maximize the profit. The decision problem can be formulated as
Maximize z = 400x1 + 500x2
subject to
6x1 +3x2 ≤300
2x1 +6x2 ≤250
6x1 +4x2 ≥120
8x1 + 5x2 ≥ 100
x1 ≥ 0, x2 ≥ 0
*****************************************************************************************
X=Y, …………..= X≥Y and X≤Y….. X≥Y and -X≥-Y…….OR -X≤-Y and X≤Y

Gipe Moduel 9 Lpp1

Uploaded by

Copyright:

Available Formats

Gipe Moduel 9 Lpp1

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Gipe Moduel 9 Lpp1

Uploaded by

Copyright:

Available Formats

GIPE

Common terminologies used in Linear Programming

 Each unit of A requires 1 unit of Milk and 3 units of Choco

 Rs 6 per unit A sold

Milk Choco Profit per unit

Let the total number of units produced by A be = X

Let the total number of units produced by B be = Y

Now, the total profit is represented by Z

Nutrient Food Item

Thiamin 0.12 mg/oz 0.10 mg/oz

Phosphorus 0.75 mg/oz 1.70 mg/oz

Iron 1.20 mg/oz 1.10 mg/oz

Minimize z = 2x1 + 1.7x2

Food Item 1 Food Item 2 Food Item 3 Food Item 4

Variety Cost (Price/Hec) Net Profit (Price/Hec) Man-days/Hec

Example 5 - Blending Problem

Process Input (units) Output (units) Profit

Crude P Crude Q Gasoline S Gasoline T

Total 300 250 120 100

Maximize z = 400x1 + 500x2

You might also like