Q1.

An animal feed company must produce at least 200 kgs of a mixture consisting of ingredients
𝑥 and 𝑥 daily. 𝑥 costs Birr 3 per kg and 𝑥 Birr 8 per kg. No more than 80 kg of 𝑥 can be used and
at least 60 kg of 𝑥 must be used.
a. Formulate a mathematical linear programming model to the problem.
b. Solve minimization by using graphical approach.
Minimize (total cost)

Z=3x1+8x2
Subject to constraints

X1+X2=200

X1<=80

X2>=60

X1>=0

X1>=0

SOLUTION

Where X 1 = no. of kgs of ingredient X 1 and X 2 = no. kgs of ingredient X 2

X 1 + X 2 + X 3 =200 , X 1 + X 4 =80 , X 2 −X 5 =60

The first constraint X1 + X2 =200 can be represented as follows.

We set X1 + X2 = 200
When X1 = 0 in the above constraint, we get,
0 + X2 = 200
X2 = 200
Similarly when X2 = 0 in the above constraint, we get,
X1 + 0 = 200
X1 = 200
The second constraint X1 ≤ 80 can be represented as follows,
We set X1 = 80
The third constraint X2 >= 60 can be represented as follows,
 We set X2 = 60

Cost = 3x1 + 8x2 as Cost of x is less hence we must use maximum a but Not more than 80 kg.
Of a can be used

Hence a = 80 kg

X2 = 200 - 80 = 120 kg

Cost = 3 * 80 + 8 * 120= 240 + 960= 1200

Cost of mixture = Rs 1200

X 1 =80 , X 2 =120 , S=0

Point X1 X2 Z = 3X1 +8X2

0 0 0 0
A 0 200 Z = 3 x 0 + 8 x 200 = 1,600
B 200 0 Z = 3 x 200 + 8 x 0 = 600=minimum
C 80 120 Z = 3 x 80 + 8 x 120 = 1200

Q2. A nutritionist advises an individual who is suffering from iron and vitamin B deficiency to
take at least 2400 milligrams (mg) of iron, 2100 mg of vitamin B1, and 1500 mg of vitamin B2
over a period. Two vitamin pills are suitable, brand-A and brand-B. Each brand-A pill costs 6
cents and contains 40 mg of iron, 10 mg of vitamin B1, and 5 mg of vitamin B2. Each brand-B
pill costs 8 cents and contains 10 mg of iron and 15 mg each of vitamins B1 and B2.
a. Formulate a mathematical linear programming model to the problem
b. What combination of pills should the individual purchase in order to meet the minimum iron
and vitamin requirements at the lowest cost? Use graph method

Solution

 first tabulate the given information:

Brand-A Brand-B Minimum Requirement

Cost/Pill 6 8
Iron 40 mg 10 mg 2400 mg
Vitamin B1 10 mg 15 mg 2100 mg
Vitamin B2 5mg 15 mg 1500 mg

 Let x be the number of brand-A pills and y the number of brand-B pills to be purchased.
 The cost C (in cents) is given by and is the objective function to be minimized.
C= 6X+8Y
 The amount of iron contained in x brand-A pills and y brand-B pills is given by 40x + 10y
mg, and this must be greater than or equal to 2400 mg. This translates into the inequality
40X+10Y>=2400
 The amount of vitamin B1 contained in x brand-A pills and y brand-B pills is given by
10x + 15y mg, and this must be greater or equal to 2100 mg. This translates into the
inequality
10X+15Y>=2100
 The amount of vitamin B2 contained in x brand-A pills and y brand-B pills is given by 5x
+ 15y mg, and this must be greater or equal to 1500 mg. This translates into the inequality
5X+15Y>=1500
 In short, we want to minimize the objective function
C= 6X+8Y
40X+10Y>=2400
10X+15Y>=2100
5X+15Y>=1500
X>=0
Y>=0
 Graphical Solutions of Linear Programming Problems

 Which asked us to determine the optimal combination of pills to be purchased in order to

meet the minimum iron and vitamin requirements at the lowest cost.
 We restated the problem as a linear programming problem in which we wanted to
minimize the objective function
C= 6X+8Y
Subject to the system of inequalities
40X+10Y>=2400
10X+15Y>=2100
5X+15Y>=1500
X, Y>=0
 We can now solve the problem graphically. We first graph the feasible set S for the
problem. Graph the solution for the inequality
40X+10Y>=2400 considering only positive values for x and y:
 We first graph the feasible set S for the problem.
 Graph the solution for the inequality
10X+15Y>=2100 considering only positive values for x and y:

 We first graph the feasible set S for the problem.

 Graph the solution for the inequality
5X+15Y>=1500 considering only positive values for x and y:

 We first graph the feasible set S for the problem.

 Graph the intersection of the solutions to the inequalities, yielding the feasible set S.
(Note that the feasible set S is unbounded)
 Next, find the vertices of the feasible set S.
 The vertices are A(0, 240), B(30, 120), C(120, 60), and D(300, 0).

 Now, find the values of C at the vertices and tabulate them:

Vertex C = 6x + 8y

A(0, 240) 1920

B(30, 120) 1140

C(120, 60) 1200

1800
D(300, 0)
  Finally, identify the vertex with the lowest value for C:
 We can see that C is minimized at the vertex B (30, 120) and has a value of 1140.

Vertex C = 6x + 8y

A(0, 240) 1920

B(30, 120) 1140

C(120, 60) 1200

1800
D(300, 0)

 Finally, identify the vertex with the lowest value for C:

 We can see that C is minimized at the vertex B (30, 120) and has a value of 1140.
 Recalling what the symbols x, y, and C represent; we conclude that the individual should
purchase 30 brand-A pills and 120 brand-B pills at a minimum cost of $11.40.
  The Simplex Method: Standard Maximization Problems

x y u v p constant

1 0 3/5 –1/5 0 48

0 1 –1/5 2/5 0 84

0 0 9/25 7/25 1 148 4/5

Q3. A company is involved in the

Produce X and Y are twofold, namely machine time for automatic processing and craftsman time
For hand finishing. The table below gives the number of minutes required for each item:
Machine time Craftsman time
Machine Time Craftsman Time Machine Time Craftsman Time

Item X 13 20
Item Y 19 29

The company has 40 hours of machine time available in the next working week but only 35
Hours of craftsman time. Machine time is costed at Birr 10 per hour worked and craftsman time
Is costed at Birr 2 per hour worked. Both machine and craftsman idle times incur no costs. The
Revenue received for each item produced (all production is sold) is Birr 20 for X and Birr 30 for
Y. The company has a specific contract to produce 10 items of X per week for a particular
customer.
a. Formulate the problem of deciding how much to produce per week as a linear program.
b. Find optimization solution
Solution
Let 𝑥 be the number of items of 𝑋, 𝑦 be the number of items of 𝑌.
Maximize 20𝑥 + 30𝑦 − 10(𝑚𝑎𝑐ℎ𝑖𝑛𝑒 𝑡𝑖𝑚𝑒 𝑤𝑜𝑟𝑘𝑒𝑑) − 2(𝑐𝑟𝑎𝑓𝑡𝑠𝑚𝑎𝑛 𝑡𝑖𝑚𝑒 𝑤𝑜𝑟𝑘𝑒𝑑)
Subject to: 13𝑥 + 19𝑦≤ 40(60) 𝑚𝑎𝑐ℎ𝑖𝑛𝑒 𝑡𝑖𝑚𝑒 20𝑥 + 29𝑦≤ 35(60) 𝑐𝑟𝑎𝑓𝑡𝑠𝑚𝑎𝑛 𝑡𝑖𝑚𝑒 𝑥≥ 10
contract 𝑥,≥ 0
So that the objective function becomes
Maximize
20𝑥 + 30𝑦 −10 (13𝑥 + 19𝑦) 60 −2 (20𝑥 + 29𝑦) 60 =17.1667𝑥 + 25.8667𝑦
Subject to:
13𝑥 + 19𝑦≤ 2400
20𝑥 + 29𝑦≤ 2100
𝑥≥ 10
𝑥,≥ 0
It is plain from the diagram below that the maximum occurs at the intersection of 𝑥=10 and
20𝑥 + 29𝑦≤ 2100.
Solving simultaneously, rather than by reading values off the graph, we have that 𝑥=10 and
𝑦=65.52 with the value of the objective function being 1866.5.
Q4. Consider the following problem.
Max 3x1 + 2x2
Subject Function
3x1 + x2 ≤ 12
X1 + x2 ≤ 6
5x1 + 3x2 ≤ 27
X1, x2 ≥ 0.
a. Solve the problem by the original simplex method (in tabular form).
b. Solve the dual of this problem manually by the dual simplex method.
Step 3- obtaining the initial simplex tableau

BV Cj 3 2 0 0 0 bj bj/aj
CB X1 X2 S1 S2 S3
S1 0 3 1 1 0 0 12
S2 0 1 1 0 1 0 6
S3 0 5 3 0 0 1 27
Zj 0 0 0 0 0 0
Cj-Zj 3 2 0 0 0

Step 4: Test if the current solution is optimum or not:

Since our solution is not optimal (because Cj-Zj≥ 0).

Step 5: Identify the Entering and Leaving Variables

BV Cj 3 2 0 0 0 bj bj/aj
CB X1 X2 S1 S2 S3
S1 0 3 1 1 0 0 12 12/3=4
S2 0 1 1 0 1 0 6 6/1=6
S3 0 5 3 0 0 1 27 27/5=5.4
Zj 0 0 0 0 0
Cj-Zj 3 2 0 0 0

Incoming Variable key Element key row

Step 6. Evaluate the new solution by constructing a second simplex tableau.

 Entering variable value =old value /key element

3/3=1, 1/3=1/3, 1/3=1/3, 0/3=0, 0/3=0, 12/3=4
  New row element = old row element-(key column element*new key row or
replacement row value).
S21-1*1=0, 1-1*1/3=0. 0-1*0=0
1-1*1/3=0, 1-1*0=1, 6-1*4=2,

S35-5*1=0, 0-5*1/3=-5. 1-5*0=1

3-5*1/3=-2, 0-5*0=0, 27-5*4=7,
BV Cj 3 2 0 0 0 bj bj/aj
CB X1 X2 S1 S2 S3
X1 3 1 1/3 1/3 0 0 4 4/1=4
S2 0 0 0 0 1 0 2 2/0=0
S3 0 0 -2 -5 0 1 7 7/0=0
Zj 3 3 3 0 0 12
Cj-Zj 0 -1 -3 0 0

 Since our solution is satisfied optimality condition (Cj-Zj≤ 0), therefore the
optimal.

Max Z 3x1 + 2x2

X1=4
X2=0
3*4+2*0=12=12
Z=12

Q5. If j=Cj-Zj is equal to 24 – 7M for x1;28-7M for x2;45-4M for x 3 and 28-
2M in respect of x4 in a minimization problem, then the what is entering variable?

X1-24-7M 24-7*1
Let m=1 =24-7=17
X2-28-7M =45-4=41
28-7*1 X4--28-2M
=28-7=21 =28-2*1
X3-45-4M 28-2=26
=45-4*1

 Therefore from the above equitation X1-24-7M the small positive number and
the most negative numbers for this reason the entering variable is X1-24-7M