A Single Unit of Each of The Maxivite and Healthovite Pills Contains 500 MG and 100 MG of Iron Respectively Thus, M of Maxivite Pills As Hence
A Single Unit of Each of The Maxivite and Healthovite Pills Contains 500 MG and 100 MG of Iron Respectively Thus, M of Maxivite Pills As Hence
A Single Unit of Each of The Maxivite and Healthovite Pills Contains 500 MG and 100 MG of Iron Respectively Thus, M of Maxivite Pills As Hence
FORMULATION OF MODEL:
We are denoting each of our decision variables as follows:
m be the number of the Maxivite pills to be consumed by walrus
h be the number of the Healthovite pills to be consumed by walrus
Thus, consuming m of Maxivite pills & h of Healthovite pills will cost a total of 0.07m+0.06h (in dollars).
Let us denote this total profit as c.
Now, as the objective is to minimize the total cost hence the objective function would be
Minimize c=0.07m+0.06h
CONSTRAINTS:
Iron Requirement:
A single unit of each of the Maxivite and Healthovite pills contains 500 mg and 100 mg of iron respectively thus, m of Maxivite pills
& h of Healthovite pills will contain a total of 500m+100h mg of iron and as the the minimum iron to be consumed is 2500 mg. Thus,
as
The Total available Iron (mg)≥ The Least Required Iron (mg)
Hence,
500m+100h ≥ 2500
Similarly, for
Vitamin B1 Requirement:
200m+150h ≥ 2100
Vitamin B2 Requirement:
100m+150h ≥ 1500
We, now, have following LP Model:
Decision Variables:
m be the number of the Maxivite pills to be consumed by walrus
h be the number of the Healthovite pills to be consumed by walrus
Objective Function:
Minimize c=0.07m+0.06h
Constraints:
500m+100h ≥ 2500 (Iron)
200m+150h ≥ 2100 (B1)
100m+150h ≥ 1500 (B2)
Non-negative restrictions
m, h ≥ 0
(a) Results for this part, on the basis of the above formulated LPP, is highlighted below:
Minimize c=0.07m+0.06h
Subjected to
500m+100h ≥ 2500 (Iron)
200m+150h ≥ 2100 (B1)
100m+150h ≥ 1500 (B2)
Other restrictions
m, h ≥ 0
(b)
To solve above LPP using graphical method, we will plot all the constraint and find the corner points of feasible region
and the determine that at which corner point optimality of objective function is achieved.
To plot all the constraint, let us represent m-variable on x-axis and h-variable on y-axis and determine the two-points on
each of the constraint boundary as below.
Now we have at least two point on each of the constraint boundary hence these can be plotted as below:
28
26
A(0,25)
24
22
20
18
16
h
C(0,14)
14
Feasible Region
12
10 E(0,10) P
6
Q
From above plot, shaded area with lower boundary APQF is the feasible region.
Now, we have to evaluate the value of objective function at each of the corners A, P, Q, & F. Coordinates of A & F are
already known. Coordinates of P & Q can be obtained as blow:
For P, solving the simultaneous equations: 500m+100h =2500, 200m+150h = 2100 we can get m=3 & n=10, thus
coordinate of P is (3,10)
For Q, solving the simultaneous equations:200m+150h + 2100, 100m+150h =1500 we can get m=6 & n=6, , thus
coordinate of Q is (6,6)
Now, the value of Objective function at all corner points is calculated below: