There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and F2 consists of 5%nitrogen and 10%phosphoric acid. After testing the soil conditions, a farmer finds that she needs at least 14kg of phosphoric acid for her crop. If F1 costs Rs6/kg and F2 costs Rs5/kg, determine how much of each type of fertilizer should be used so that nutrient requirements are met at a minimum cost. What is the minimum cost?
Let the farmer buy x kg of fertilizer F1 and y kg of fertilizer F2.
Therefore, x≥0 and y≥0
The given information can be compiled in a table as follows.
Nitrogen(%) | Phosphoric Acid(%) | Cost(Rs/kg) | |
F1(x) | 10 | 6 | 6 |
F2(y) | 5 | 10 | 5 |
Requirement(kg) | 14 | 14 |
F1 consists of 10% nitrogen and F2 consists of 5% nitrogen. However, the farmer requires at least 14 kg of nitrogen.
∴10% of x+5% of y≥14
\(\frac{x}{10}+\frac{y}{20}\)≥14
2x+y≥280
F1 consists of 6% phosphoric acid and F2 consists of 10% phosphoric acid. However, the farmer requires at least 14 kg of phosphoric acid.
∴ 6%of x+10%of y≥14
\(\frac{6x}{100}+\frac{10y}{100}\)≥14
3x+56y≥700
The total cost of fertilizers, Z=6x+5y
The mathematical formulation of the given problem is
Minimize Z=6x+5y...(1)
Subject to the constraints,
2x+y≥280...(2)
3x+5y≥700...(3)
x,y≥0....(4)
The feasible region determined by the system of constraints is as follows.
It can be seen that the feasible region is unbounded.
The corner points are A(\(\frac{700}{3}\),0), B(100,80), and C(0,280)
The values of Z at these points are as follows:
Corner point | z=6x+5y | |
A(\(\frac{700}{3}\),0) | 1400 | |
B(100,80) | 1000 | \(\rightarrow\)Minimum |
C(0,280) | 1400 |
As the feasible region is unbounded, therefore, 1000 may or may not be the minimum value of Z.
For this, we draw a graph of the inequality, 6x+5y<1000, and check whether the resulting half-plane has points in common with the feasible region or not.
It can be seen that the feasible region has no common point with
6x+5y<1000
Therefore, 100kg of fertilizer F1 and 80kg of fertilizer F2 should be used to minimize the cost. The minimum cost is 1000.
Given the Linear Programming Problem:
Maximize \( z = 11x + 7y \) subject to the constraints: \( x \leq 3 \), \( y \leq 2 \), \( x, y \geq 0 \).
Then the optimal solution of the problem is:
The Linear Programming Problems (LPP) is a problem that is concerned with finding the optimal value of the given linear function. The optimal value can be either maximum value or minimum value. Here, the given linear function is considered an objective function. The objective function can contain several variables, which are subjected to the conditions and it has to satisfy the set of linear inequalities called linear constraints.
Step 1: Establish a given problem. (i.e.,) write the inequality constraints and objective function.
Step 2: Convert the given inequalities to equations by adding the slack variable to each inequality expression.
Step 3: Create the initial simplex tableau. Write the objective function at the bottom row. Here, each inequality constraint appears in its own row. Now, we can represent the problem in the form of an augmented matrix, which is called the initial simplex tableau.
Step 4: Identify the greatest negative entry in the bottom row, which helps to identify the pivot column. The greatest negative entry in the bottom row defines the largest coefficient in the objective function, which will help us to increase the value of the objective function as fastest as possible.
Step 5: Compute the quotients. To calculate the quotient, we need to divide the entries in the far right column by the entries in the first column, excluding the bottom row. The smallest quotient identifies the row. The row identified in this step and the element identified in the step will be taken as the pivot element.
Step 6: Carry out pivoting to make all other entries in column is zero.
Step 7: If there are no negative entries in the bottom row, end the process. Otherwise, start from step 4.
Step 8: Finally, determine the solution associated with the final simplex tableau.