Solution:

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

We must note that the m, and h can’t be negative hence m, h ≥ 0

 
OBJECTIVE FUNCTION:
For the optimality one must determine the number of each type of pills required so that cost is minimized, given that
1. A Maxivite pill costs a profit of $0.07and hence m - Maxivite pills will cost $0.07m.
2. A Healthovite pill contributes a profit of $0.06 and hence h - Healthovite pills will cost  $0.06h

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)

Now we will solve above LPP using Graphical method

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.

Plotting constraints & hence feasible region and corner points:

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.

Constraint # Constraint First Point Second Point Area covered by

Boundary constraints
For m=0 (assume) then For h=0 (assume) then From the boundary to
Iron Constraint 500m+100h = 2500 500m+100h = 2500 outwards the origin
500m+100h = 2500
500m+100h ≥ 2500 gives h=25; hence, gives m=5; hence, (0,0) as the constraint
coordinate of first coordinate of second point is greater than or equal
point A(0,25). B(5,0). to type.
For m=0 (assume) then For h=0 (assume) then From the boundary to
B1 Constraint 200m+150h = 2100 200m+150h = 2100 outwards the origin
200m+150h = 2100
200m+150h ≥ 2100 gives h=14; hence, gives m=10.5; hence, (0,0) as the constraint
coordinate of first coordinate of first point is greater than or equal
point C(0,14). D(10.5,0). to type.
B2 Constraint 100m+150h = 1500 For m=0 (assume) then For h=0 (assume) then From boundary to
100m+150h ≥ 1500 100m+150h = 1500 100m+150h = 1500 outwards origin (0,0)
gives h=10; hence, gives m=15; hence, as the constraint is
coordinate of first coordinate of first point greater than or equal
 point E(0,10). F(15,0). to type.

Now we have at least two point on each of the constraint boundary hence these can be plotted as below:

Constraints and Feasible Region of Linear Program

30

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

O(0,0) B(5,0) D(10.5,0) F(15,0)

0
0 2 4 6 8 10 12 14 16 18 20

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:

Extreme/Corner Pont m & h at corner point Value of Objective Function

C=0.07*m+0.06h
A (0, 25) m=0 & h=25 C=0.07*0+0.06*25=1.5
P (3,10) m=3 & h=10 C=0.07*3+0.06*10=0.81
Q (6,6) m=6 & h=6 C=0.07*6+0.06*6=0.78 (Minimum)
F(15,0) m=15 & h=0 C=0.07*15+0.06*0=1.05

Hence, Q is optimal point of consumption at which

m =Number of the Maxivite pills to be consumed by walrus=6
h =Number of the Healthovite pills to be consumed by walrus=6
and

The minimum cost=$0.78