TOSSA COLLEGE OF ECONOMIC DEVELOPMENT

Group Assignment for the course Quantitative Analysis for Managerial Decision
Making (Operations Research) (50%)

Instructions:

 All group member should participate equally.

 Each group should work all the given questions.
 Please write your report with Times New roman font type a 1.5 Line spacing and with 12
font size or you can submit your hand written solution.
 Please submit your assignment with soft copy to the college.
 Dead line will be decided by the college coordinator.
 Please don’t copy other group’s work.

1. Brothers Biscuit and Flour Company makes a cereal from several ingredients. Two of the
ingredients, oats and rice, provide vitamins A and B. The company wants to know how many
ounces of oats and rice it should include in each box of cereal to meet the minimum
requirements of 48 milligrams of vitamin A and 12 milligrams of vitamin B while
minimizing cost. An ounce of oats contributes 8 milligrams of vitamin A and 1 milligram of
vitamin B, whereas an ounce of rice contributes 6 milligrams of A and 2 milligrams of B. An
ounce of oats costs $5, and an ounce of rice costs $3.
a. Formulate a linear programming model for this problem.

1
Let;

b. Solve this model by using graphical analysis.

To solve the problem graphically, we'll follow these steps:

1 ,Plot the constraints: We have two constraints:

2 , Identify the feasible region: This is the area where both constraints are
satisfied. Since both constraints are inequalities, we'll shade the area above the
lines representing the constraints.
3 Find the corner points of the feasible region: These are the points where the
lines intersect.

5 Select the optimal solution: Choose the corner point that minimizes the
objective function value.

Let's start by plotting the constraints and finding the feasible region. We'll then proceed
with finding the corner points and evaluating the objective function. We can use this
information to determine the optimal solution. Since I can't directly draw, I'll guide you
through the process step by step. Let's begin by plotting the constraints.
Let's start by plotting the constraints:

2
6 Addis Fertilizer Company makes a fertilizer using two chemicals that provide
nitrogen, phosphate, and potassium. A pound of ingredient 1 contributes 10 ounces of
nitrogen and 6 ounces of phosphate, while a pound of ingredient 2 contributes 2
ounces of nitrogen, 6 ounces of phosphate, and 1 ounce of potassium. Ingredient 1
costs $3 per pound, and ingredient 2 costs $5 per pound. The company wants to know
how many pounds of each chemical ingredient to put into a bag of fertilizer to meet
the minimum requirements of 20 ounces of nitrogen, 36 ounces of phosphate, and 2
ounces of potassium while minimizing cost.

3
a. Formulate a linear programming model for this problem.

b. Solve this model by using Simplex analysis.

a) To formulate the linear programming model:

Let \( x_1 \) be the number of pounds of ingredient 1 used,

and \( x_2 \) be the number of pounds of ingredient 2 used.

The objective function, representing the total cost (\( Z \)), is given by:

\[ Z = 3x_1 + 5x_2 \]

Subject to the following constraints:

1. Nitrogen constraint: \( 10x_1 + 2x_2 =20 \)

2. Phosphate constraint: \( 6x_1 + 6x_2 =36 \)

3. Potassium constraint: \( 0x_1 + 1x_2 =2 \)

4. Non-negativity constraint: \( x_1, x_2 \geq 0 \)

b) To solve this model using simplex analysis, we need to convert the inequalities
into equalities by introducing slack variables, and then set up the initial simplex
table. After that, we iterate through the simplex method to find the optimal solution.

4
Let's proceed with setting up the initial simplex table.

To set up the initial simplex table, we'll first rewrite the constraints as equations by
introducing slack variables:

1. Nitrogen constraint: \( 10x_1 + 2x_2 + s_1 = 20 \)

2. Phosphate constraint: \( 6x_1 + 6x_2 + s_2 = 36 \)

3. Potassium constraint: \( x_2 + s_3 = 2 \)

The objective function remains the same: \( Z = 3x_1 + 5x_2 \).

Now, let's set up the initial simplex table:

\[

\begin{array}{|c|c|c|c|c|c|c|}

\hline

\text{Iteration} & \text{Basic Variables} & x_1 & x_2 & s_1 & s_2 & s_3 & \
text{Constants} \\

\hline

0 & Z & 3 & 5 & 0 & 0 & 0 & 0 \\

5
\hline

& s_1 & 10 & 2 & 1 & 0 & 0 & 20 \\

& s_2 & 6 & 6 & 0 & 1 & 0 & 36 \\

& s_3 & 0 & 1 & 0 & 0 & 1 & 2 \\

\hline

\end{array}

\]

The coefficients in the first row represent the coefficients of the objective function \
( Z \), and the coefficients in the remaining rows represent the coefficients of the
variables and slack variables in the constraints. The last column represents the
constants on the right-hand side of the equations.

Now, we'll perform the simplex method to find the optimal solution. Let's start the
iterations.

The initial simplex table is set up. Now, let's perform the iterations of the simplex
method to find the optimal solution.

**Iteration 0:**

6
The coefficients of the objective function are:

\[ Z = 3x_1 + 5x_2 + 0s_1 + 0s_2 + 0s_3 \]

The current values of \( x_1 \), \( x_2 \), \( s_1 \), \( s_2 \), and \( s_3 \) are all zero.

Now, we need to find the most negative coefficient in the bottom row (excluding the
constants column) to determine the entering variable. In this case, \( x_1 \) has the
most negative coefficient (-3), so \( x_1 \) will be the entering variable.

Next, we need to determine the leaving variable by finding the minimum ratio of the
constants column to the corresponding coefficient of the entering variable. The
ratios are calculated as follows:

- For \( s_1 \): \( \frac{20}{10} = 2 \)

- For \( s_2 \): \( \frac{36}{6} = 6 \)

- For \( s_3 \): \( \frac{2}{0} \) (This division is not possible as the coefficient of \
( x_1 \) in the potassium constraint is zero, indicating that \( x_1 \) cannot enter the
basis).

Since the ratio for \( s_1 \) is the smallest, \( s_1 \) will be the leaving variable.

7
Now, we perform row operations to pivot on the element in the intersection of the
leaving variable's row and the entering variable's column (also known as the pivot
element), making it equal to 1 and eliminating all other elements in the entering
variable's column.

After performing the row operations, the simplex table becomes:

\[

\begin{array}{|c|c|c|c|c|c|c|}

\hline

\text{Iteration} & \text{Basic Variables} & x_1 & x_2 & s_1 & s_2 & s_3 & \
text{Constants} \\

\hline

0 & Z & 3 & 5 & 0 & 0 & 0 & 0 \\

\hline

& s_1 & 1 & 0.2 & 0.1 & 0 & 0 & 2 \\

& s_2 & 0 & 4 & -0.6 & 1 & 0 & 12 \\

& x_1 & 0 & 1 & 0 & 0.1 & 0 & 2 \\

\hline

\end{array}

8
\]

Now, we repeat the iterations until we reach the optimal solution. Let's proceed with
the next iteration.

**Iteration 1:**

The coefficients of the objective function are:

\[ Z = 3x_1 + 5x_2 + 0s_1 + 0s_2 + 0s_3 \]

Now, we need to find the most negative coefficient in the bottom row (excluding the
constants column) to determine the entering variable. In this case, \( x_2 \) has the
most negative coefficient (-5), so \( x_2 \) will be the entering variable.

Next, we need to determine the leaving variable by finding the minimum ratio of the
constants column to the corresponding coefficient of the entering variable. The
ratios are calculated as follows:

- For \( s_1 \): \( \frac{2}{0.2} = 10 \)

- For \( s_2 \): \( \frac{12}{4} = 3 \)

- For \( x_1 \): \( \frac{2}{1} = 2 \)

9
 Since the ratio for \( s_2 \) is the smallest, \( s_2 \) will be the leaving variable.

Now, we perform row operations to pivot on the element in the intersection of the
leaving variable's row and the entering variable's column (also known as the pivot
element), making it equal to 1 and eliminating all other elements in the entering
variable's column.

After performing the row operations, the simplex table becomes:

\[

\begin{array}{|c|c|c|c|c|c|c|}

\hline

\text{Iteration} & \text{Basic Variables} & x_1 & x_2 & s_1 & s_2 & s_3 & \
text{Constants} \\

\hline

0 & Z & 3 & 5 & 0 & 0 & 0 & 0 \\

\hline

& s_1 & 1 & 0.2 & 0.1 & 0 & 0 & 2 \\

& x_2 & 0 & 1 & -0.15 & 0.25 & 0 & 3 \\

10
 & x_1 & 0 & 0 & 0.6 & -0.1 & 0 & 6 \\

\hline

\end{array}

\]

Now, we repeat the iterations until we reach the optimal solution. Let's proceed with
the next iteration.

**Iteration 2:**

The coefficients of the objective function are:

\[ Z = 3x_1 + 5x_2 + 0s_1 + 0s_2 + 0s_3 \]

Now, we need to find the most negative coefficient in the bottom row (excluding the
constants column) to determine the entering variable. In this case, \( s_1 \) has the
most negative coefficient (-0.6), so \( s_1 \) will be the entering variable.

Next, we need to determine the leaving variable by finding the minimum ratio of the
constants column to the corresponding coefficient of the entering variable. The
ratios are calculated as follows:

11
 - For \( x_2 \): \( \frac{3}{1} = 3 \)

- For \( x_1 \): \( \frac{6}{0.6} = 10 \)

Since the ratio for \( x_2 \) is the smallest, \( x_2 \) will be the leaving variable.

Now, we perform row operations to pivot on the element in the intersection of the
leaving variable's row and the entering variable's column (also known as the pivot
element), making it equal to 1 and eliminating all other elements in the entering
variable's column.

After performing the row operations, the simplex table becomes:

\[

\begin{array}{|c|c|c|c|c|c|c|}

\hline

\text{Iteration} & \text{Basic Variables} & x_1 & x_2 & s_1 & s_2 & s_3 & \
text{Constants} \\

\hline

0 & Z & 3 & 5 & 0 & 0 & 0 & 0 \\

\hline

12
 & s_1 & 1 & 0.2 & 0.1 & 0 & 0 & 2 \\

& x_2 & 0 & 1 & -0.15 & 0.25 & 0 & 3 \\

& x_1 & 0 & 0 & 1 & -0.167 & 0 & 10 \\

\hline

\end{array}

\]

Now, since all coefficients of the objective function in the bottom row are non-
negative, we have reached the optimal solution.

The optimal solution is \( x_1 = 10 \) pounds of ingredient 1 and \( x_2 = 3 \) pounds

of ingredient 2, with a total cost of \( Z = 3(10) + 5(3) = 30 + 15 = 45 \) dollars.

7 Shewa Bakery makes coffee cakes and Danish pastries in large pans. The main
ingredients are flour and sugar. There are 25 pounds of flour and 16 pounds of sugar
available, and the demand for coffee cakes is 5. Five pounds of flour and 2 pounds of
sugar are required to make a pan of coffee cakes, and 5 pounds of flour and 4 pounds
of sugar are required to make a pan of Danish. A pan of coffee cakes has a profit of
$1, and a pan of Danish has a profit of $5. Determine the number of pans of cakes and
Danish to produce each day so that profit will be maximized.

a. Formulate a linear programming model for this problem.

b. Solve this model by using graphical analysis.

a) To formulate the linear programming model:

13
Let \( x_1 \) be the number of pans of coffee cakes produced per day,

and \( x_2 \) be the number of pans of Danish pastries produced per day.

The objective function, representing the total profit (\( Z \)), is given by:

\[ Z = 1x_1 + 5x_2 \]

Subject to the following constraints:

1. Flour constraint: \( 5x_1 + 5x_2 \leq 25 \)

2. Sugar constraint: \( 2x_1 + 4x_2 \leq 16 \)

3. Non-negativity constraint: \( x_1, x_2 \geq 0 \)

b) To solve this model using graphical analysis:

First, plot the feasible region determined by the constraints:

1. \( 5x_1 + 5x_2 \leq 25 \) or \( x_1 + x_2 \leq 5 \)

2. \( 2x_1 + 4x_2 \leq 16 \)

3. \( x_1 \geq 0 \) and \( x_2 \geq 0 \)

Then, identify the vertices of the feasible region by solving the equations formed by the
intersection of the constraint lines.

Finally, evaluate the objective function \( Z = 1x_1 + 5x_2 \) at each vertex to determine the
maximum profit.

14
Let's proceed with the graphical analysis to find the optimal solution.

First, let's plot the feasible region determined by the constraints:

1. \( 5x_1 + 5x_2 \leq 25 \) or \( x_1 + x_2 \leq 5 \)

2. \( 2x_1 + 4x_2 \leq 16 \)

3. \( x_1 \geq 0 \) and \( x_2 \geq 0 \)

The feasible region is bounded by the lines representing these constraints.

Let's plot these lines:

1. \( x_1 + x_2 = 5 \)

2. \( 2x_1 + 4x_2 = 16 \)

Then, we'll shade the feasible region.

Let's start by plotting the lines.

To plot the lines:

1. For \(x_1 + x_2 = 5\):

15
 When \(x_1 = 0\), \(x_2 = 5\).

When \(x_2 = 0\), \(x_1 = 5\).

Plotting these points and connecting them will give us the line.

2. For \(2x_1 + 4x_2 = 16\):

When \(x_1 = 0\), \(x_2 = 4\).

When \(x_2 = 0\), \(x_1 = 8\).

Plotting these points and connecting them will give us the line.

Let's proceed with the plot.

Let's plot the lines:

1. For \(x_1 + x_2 = 5\):

When \(x_1 = 0\), \(x_2 = 5\).

When \(x_2 = 0\), \(x_1 = 5\).

Plotting these points and connecting them will give us the line.

2. For \(2x_1 + 4x_2 = 16\):

When \(x_1 = 0\), \(x_2 = 4\).

When \(x_2 = 0\), \(x_1 = 8\).

Plotting these points and connecting them will give us the line.

16
Let's proceed with the plot.

Here's the plot of the lines representing the constraints:

1. \(x_1 + x_2 = 5\)

2. \(2x_1 + 4x_2 = 16\)

Now, let's shade the feasible region bounded by these lines.


The shaded area represents the feasible region determined by the constraints \(5x_1 + 5x_2 \leq
25\) and \(2x_1 + 4x_2 \leq 16\), as well as the non-negativity constraints \(x_1 \geq 0\) and \
(x_2 \geq 0\).

Next, we'll identify the vertices of this feasible region and evaluate the objective function at each
vertex to find the optimal solution.

To find the vertices of the feasible region, we need to find the intersection points of the lines that
form the boundaries of the region.

The intersection points are:

1. The intersection of the lines \(x_1 + x_2 = 5\) and \(2x_1 + 4x_2 = 16\).

2. The intersection of the lines \(x_1 + x_2 = 5\) and the x-axis.

17
3. The intersection of the lines \(2x_1 + 4x_2 = 16\) and the x-axis.

Let's solve these equations to find the coordinates of the vertices.

1. Solving the system of equations \(x_1 + x_2 = 5\) and \(2x_1 + 4x_2 = 16\):

From \(x_1 + x_2 = 5\), we can express \(x_1\) as \(x_1 = 5 - x_2\).

Substituting this expression into \(2x_1 + 4x_2 = 16\):

\[ 2(5 - x_2) + 4x_2 = 16 \]

\[ 10 - 2x_2 + 4x_2 = 16 \]

\[ 10 + 2x_2 = 16 \]

\[ 2x_2 = 16 - 10 \]

\[ 2x_2 = 6 \]

\[ x_2 = \frac{6}{2} \]

\[ x_2 = 3 \]

Substituting \(x_2 = 3\) into \(x_1 = 5 - x_2\):

\[ x_1 = 5 - 3 \]

\[ x_1 = 2 \]

So, the coordinates of the first intersection point are \((2, 3)\).

18
2. The intersection of the lines \(x_1 + x_2 = 5\) and the x-axis occurs when \(x_2 = 0\). In this
case, \(x_1 = 5\).

So, the coordinates of the second intersection point are \((5, 0)\).

3. The intersection of the lines \(2x_1 + 4x_2 = 16\) and the x-axis occurs when \(x_2 = 0\). In
this case, \(2x_1 = 16\), so \(x_1 = 8\).

So, the coordinates of the third intersection point are \((8, 0)\).

Now, let's evaluate the objective function \(Z = x_1 + 5x_2\) at each vertex to find the maximum
profit.

Now, let's evaluate the objective function \(Z = x_1 + 5x_2\) at each vertex to find the maximum
profit:

1. For the point (2, 3):

\(Z = 1(2) + 5(3) = 2 + 15 = 17\)

2. For the point (5, 0):

\(Z = 1(5) + 5(0) = 5\)

3. For the point (8, 0):

\(Z = 1(8) + 5(0) = 8\)

19
The maximum profit occurs at the point (2, 3), where \(Z = 17\).

So, to maximize profit, Shewa Bakery should produce 2 pans of coffee cakes and 3 pans of
Danish pastries per day.

8 Solve the following linear programming model by using simplex method:

Maximize Z: 3x1 + 6x2

Subject to: 3x1 + 2x2 ≤ 18

X1 + x2 ≥ 5
X1 ≤ 4
X1, X2 ≥ 0
To solve the given linear programming model using the simplex method, let's first
convert it into standard form:

Maximize Z: 3x1 + 6x2

Subject to:
1. 3x1 + 2x2 + s1 = 18
2. -x1 - x2 + s2 = -5
3. x1 + 0x2 + s3 = 4
4. x1, x2, s1, s2, s3 ≥ 0

Now, we create the initial simplex tableau:

| Basic Variables | x1 | x2 | s1 | s2 | s3 | RHS |

|-----------------|----|----|----|----|----|-----|
| s1 | 3 | 2 | 1 | 0 | 0 | 18 |
| s2 | -1 | -1 | 0 | 1 | 0 | -5 |
| s3 |1 |0 |0 |0 |1 |4 |
| Z | -3 | -6 | 0 | 0 | 0 | 0 |

The most negative coefficient in the bottom row indicates that x2 will enter the basis.
We'll use the minimum ratio test to determine the pivot row.

For s1: 18 / 2 = 9
For s2: Not feasible (division by zero)
For s3: 4 / 0 = Not feasible (division by zero)

20
 So, we'll pivot on the s1 column and row.

Pivot element: 2 (corresponding to the s1 row and x2 column)

Divide the pivot row by the pivot element (2):

Row s1: [3/2, 1, 1/2, 0, 0, 9]

Perform row operations to make other elements in the pivot column zero:

1. Row s2: -1 - (-1/2 * 3) = -1/2

2. Row s3: 1 - (1/2 * 1) = 1/2
3. Row Z: -6 - (-1/2 * 3) = -15/2

New tableau:

| Basic Variables | x1 | x2 | s1 | s2 | s3 | RHS |

|-----------------|----|----|----|----|----|-----|
| x2 | 3/2| 1 | 1/2| 0 | 0 | 9 |
| s2 | 1/2| 1/2| 0 | 1 | 0 | 5 |
| s3 | 1/2| 0 | 0 | 0 | 1 | 4 |
| Z | -3/2| 0 | 0 | 0 | 0 | 45/2|

Since all coefficients in the bottom row are non-negative, the current solution is optimal.
The optimal solution is:
x1 = 0
x2 = 9/2
Z = 45/2 = 22.5

9 Dalol Restaurant has an ice-cream counter where it sells two main products, ice
cream and frozen yogurt, each in a variety of flavors. The restaurant makes one order
for ice cream and yogurt each week, and the store has enough freezer space for 115
gallons total of both products. A gallon of frozen yogurt costs $0.75 and a gallon of
ice cream costs $0.93, and the restaurant budgets $90 each week for these products.
The manager estimates that each week the restaurant sells at least twice as much ice
cream as frozen yogurt. Profit per gallon of ice cream is $4.15, and profit per gallon
of yogurt is $3.60.

21
 a. Formulate a linear programming model for this problem.
b. Solve this model by using graphical analysis.

3. Shewa Bakery makes coffee cakes and Danish pastries in large pans. The main ingredients are flour
and sugar. There are 25 pounds of flour and 16 pounds of sugar available, and the demand for
coffee cakes is 5. Five pounds of flour and 2 pounds of sugar are required to make a pan of coffee
cakes, and 5 pounds of flour and 4 pounds of sugar are required to make a pan of Danish. A pan of
coffee cakes has a profit of $1, and a pan of Danish has a profit of $5. Determine the number of pans
of cakes and Danish to produce each day so that profit will be maximized. a. Formulate a linear
programming model for this problem. b. Solve this model by using graphical analysis.
ChatGPT
ChatGPT
a. Formulation of Linear Programming Model:

Let:

 �x = number of pans of coffee cakes to produce each day

 �y = number of pans of Danish pastries to produce each day

Objective Function: The objective is to maximize profit, so the total profit is given by:
Maximize�=�+5�MaximizeZ=x+5y

Constraints:

1. Flour constraint: 5�+5�≤255x+5y≤25

2. Sugar constraint: 2�+4�≤162x+4y≤16
3. Non-negativity constraints: �,�≥0x,y≥0

The linear programming model for this problem can be summarized as follows:
Maximize�=�+5�MaximizeZ=x+5y subject to: 5�+5�≤255x+5y≤25
2�+4�≤162x+4y≤16 �,�≥0x,y≥0

b. Solution using Graphical Analysis:

To solve this model graphically, we'll plot the constraints and identify the feasible region. Then, we'll
find the corner points of the feasible region and evaluate the objective function at each corner point
to determine the optimal solution.

Let's denote �x on the x-axis and �y on the y-axis.

The constraints can be plotted as follows:

1. For 5�+5�≤255x+5y≤25:

22
  When �=0x=0, �=5y=5
 When �=0y=0, �=5x=5
2. For 2�+4�≤162x+4y≤16:
 When �=0x=0, �=4y=4
 When �=0y=0, �=8x=8

Now, let's plot these lines and shade the feasible region where both inequalities are satisfied.

The feasible region is the shaded area. Now, we'll evaluate the objective function
�=�+5�Z=x+5y at each corner point of the feasible region to find the optimal solution.

The corner points are:

1. (0,4)(0,4)
2. (0,5)(0,5)
3. (5,0)(5,0)
4. (8,0)(8,0)

Now, we calculate the objective function �=�+5�Z=x+5y at each corner point:

1. At (0,4)(0,4): �=0+5(4)=20Z=0+5(4)=20
2. At (0,5)(0,5): �=0+5(5)=25Z=0+5(5)=25
3. At (5,0)(5,0): �=5+5(0)=5Z=5+5(0)=5
4. At (8,0)(8,0): �=8+5(0)=8Z=8+5(0)=8

Therefore, the optimal solution occurs at (0,5)(0,5), where �=0x=0 pans of coffee cakes and
�=5y=5 pans of Danish pastries. The maximum profit associated with this solution is
�=$25Z=$25.

You
5. Dalol Restaurant has an ice-cream counter where it sells two main products, ice cream and frozen
yogurt, each in a variety of flavors. The restaurant makes one order for ice cream and yogurt each
week, and the store has enough freezer space for 115 gallons total of both products. A gallon of
frozen yogurt costs $0.75 and a gallon of ice cream costs $0.93, and the restaurant budgets $90 each
week for these products. The manager estimates that each week the restaurant sells at least twice as
much ice cream as frozen yogurt. Profit per gallon of ice cream is $4.15, and profit per gallon of
yogurt is $3.60. a. Formulate a linear programming model for this problem. b. Solve this model by
using graphical analysis.
ChatGPT
ChatGPT
a. Formulation of Linear Programming Model:

23
 Let:

 �x = gallons of ice cream

 �y = gallons of frozen yogurt

Objective Function: The objective is to maximize the profit, so the total profit is given by:
Maximize�=4.15�+3.60�MaximizeZ=4.15x+3.60y

Constraints:

1. Freezer space constraint: �+�≤115x+y≤115

2. Budget constraint: 0.93�+0.75�≤900.93x+0.75y≤90
3. Ice cream sales constraint: �≥2�x≥2y
4. Non-negativity constraints: �,�≥0x,y≥0

The linear programming model for this problem can be summarized as follows:
Maximize�=4.15�+3.60�MaximizeZ=4.15x+3.60y subject to: �+�≤115x+y≤115
0.93�+0.75�≤900.93x+0.75y≤90 �≥2�x≥2y �,�≥0x,y≥0

b. Solution using Graphical Analysis:

We can solve this linear programming problem graphically by plotting the constraints and finding
the feasible region where all constraints are satisfied. Then, we'll identify the corner points of the
feasible region and evaluate the objective function at each corner point to find the optimal solution.

Let's plot the constraints on the xy-plane and find the feasible region.

1. �+�≤115x+y≤115
2. 0.93�+0.75�≤900.93x+0.75y≤90
3. �≥2�x≥2y

After plotting these lines, we'll find the feasible region and then identify the corner points within this
region. Finally, we'll evaluate the objective function �=4.15�+3.60�Z=4.15x+3.60y at each
corner point to find the optimal solution.

Let me know if you'd like to proceed with the graphical analysis or if you need further assistance!

You
b. Solution using Graphical Analysis:
ChatGPT
ChatGPT

24
 To solve the linear programming problem graphically, let's start by plotting the constraints on the
xy-plane.

1. �+�≤115x+y≤115
2. 0.93�+0.75�≤900.93x+0.75y≤90
3. �≥2�x≥2y

Let's plot these lines and shade the feasible region where all constraints are satisfied.

The feasible region will be the intersection of the shaded areas determined by each individual
constraint.

Let's plot the lines:

1. For �+�≤115x+y≤115:
 When �=0x=0, �=115y=115
 When �=0y=0, �=115x=115
2. For 0.93�+0.75�≤900.93x+0.75y≤90:
 When �=0x=0, �=120y=120
 When �=0y=0, �=96.774x=96.774 (approximately)
3. For �≥2�x≥2y:
 When �=0y=0, �=0x=0
 When �=2�x=2y, �=2�x=2y

Let's plot these lines and shade the feasible region.

After plotting, we'll identify the corner points of the feasible region and evaluate the objective
function at each corner point to find the optimal solution.

Let me create the graph for you.

Since I'm unable to directly plot graphs, I'll describe the process and the resulting feasible region.

After plotting the lines corresponding to the constraints �+�≤115x+y≤115,

0.93�+0.75�≤900.93x+0.75y≤90, and �≥2�x≥2y, you'll find that they intersect to form a
feasible region in the first quadrant of the xy-plane.

The feasible region will be bounded by these lines and will likely form a polygon. This polygon
represents all the combinations of ice cream (x) and frozen yogurt (y) gallons that satisfy the
constraints.

Once you've identified the feasible region, you'll need to find its corner points. These corner points
are the intersections of the lines forming the boundaries of the feasible region.

25
 After identifying the corner points, you'll evaluate the objective function
�=4.15�+3.60�Z=4.15x+3.60y at each corner point to determine which combination of ice
cream and frozen yogurt yields the maximum profit.

If you have access to graphing software or a graphing tool, you can plot the lines and determine the
feasible region. Then, I can assist you further with identifying the corner points and finding the
optimal solution.

Let me know if you need further assistance or if you have any questions!

10 Solve the following linear programming model by using simplex method and explain
the solution result:

To solve the given linear programming model using the simplex method, we need to set
up the initial simplex tableau with all the given constraints. Then, we will perform
iterations to improve the objective function until all coefficients in the objective function
row are non-negative. Let's begin:

Given objective function: Minimize�=60�1+90�2MinimizeZ=60x1+90x2

Subject to the constraints:

1. 60�1+30�2≤150060x1+30x2≤1500
2. 100�1+100�2≥6000100x1+100x2≥6000
3. �2≥30x2≥30
4. �1,�2≥0x1,x2≥0

We'll start by setting up the initial simplex tableau:

26
 IterationBasic Variable�1�2Slack/Artificial VariableRight-hand SideInitia
l�609000Constraint 1603011500Constraint 210010006000Constraint 301030It
erationInitialBasic VariableZConstraint 1Constraint 2Constraint 3x160601000x2
90301001Slack/Artificial Variable0100Right-hand Side01500600030

Now, we'll perform iterations to improve the objective function by pivoting until all
coefficients in the objective function row are non-negative.

Iteration 1:

Select the most negative coefficient in the objective function row, which is -90
(corresponding to �2x2). We'll use the column corresponding to �2x2 to pivot.

The minimum ratios for the ratios test are: 150030=50301500=50 6000100=601006000
=60

We'll pivot on the variable �2x2 in the slack variable row because it has the minimum
ratio.

Iteration 1Basic Variable�1�2Slack/Artificial VariableRight-hand Sid

e�600−30−2700�22113050Constraint 2400−134000Constraint 301030Iterati
on 1Basic VariableZx2Constraint 2Constraint 3x1602400x20101Slack/Artificial
Variable−30301−310Right-hand Side−270050400030

Iteration 2:

Since all coefficients in the objective function row are non-negative, the current solution
is optimal.

The optimal solution is:

 �1=0x1=0
 �2=50x2=50

The minimum value of the objective function (profit) at this optimal solution is:
�=60(0)+90(50)=4500Z=60(0)+90(50)=4500

Therefore, the minimum value of the objective function (profit) is $4500, and it occurs
when �1=0x1=0 and �2=50x2=50.

27
This means that to minimize the cost while satisfying all constraints, we should produce
50 units of �2x2 while not producing any units of �1x1.

11 Solve the following LP Model by using a simplex Method and check your answer by
using the graphic Method?

12 Consider the balanced transportation costs tableau of the following problem

Required:
a. Formulate the LP model?
b. Calculate the initial feasible solution by using NWCM?
c. Calculate the initial feasible solution by using LCM?
d. Calculate the initial feasible solution by using VAM?
13 For the transportation problem given by the following tableau, find an initial basic feasible
solution by the North-West corner method and then find an optimal solution.

28
 14 Five warehouses are supplied by four factories. The supply available from each factory, the
demand at each warehouse and the cost per unit of transporting goods from the factories to
the warehouses are summarized in the following table:

a. Use the North-West Corner method to find an initial basic feasible solution of this problem. (Do
NOT use the Least-Cost method.)
b. Find the optimal solution of this problem, i.e. the solution that minimizes the transportation costs,
clearly showing and explaining your working.
15 Given a transportation problem with the following costs, supply, and demand, find
the initial solution using the minimum cell cost method and Vogel’s approximation
model. Is the VAM solution optimal?

16 Consider the following transportation problem:

29
A. Find the initial solution by using VAM and then solve it using the stepping-stone method.
B. Formulate this problem as a general linear programming model.
17 Given the following cost table for an assignment problem, determine the optimal
assignment and compute total minimum cost. Identify all alternative solutions if there
are multiple optimal solutions.

18 An electronics firm produces electronic components, which it supplies to various

electrical manufacturers. Quality control records indicate that different employees
produce different numbers of defective items. The average number of defects
produced by each employee for each of six components is given in the following
table. Determine the optimal assignment that will minimize the total average number
of defects produced by the firm per month.

30
 19 The following transportation problem is given to maximize the profit of an
organization. Please find the maximum profit by using the stepping stone and MODI
methods and compare the result?

20 You are given the following network diagram;

2 4 4
3

6
5
1 10

3 15

A. Find all paths in the diagram?

B. Find the critical path?
C. Find the path slack?
D. Calculate the ES, EF, LS and LF times of each activities?
E. Calculate the activity slack for all activities?

31
 21 The following table contains different activities for publishing a book, which requires
27 weeks and 10 activities.

Required:

A. Draw the network diagram for the above table?

B. Find all paths in the diagram?
C. Find the critical path?
D. Find the path slack?
E. Calculate the ES, EF, LS and LF times of each activities?
F. Calculate the activity slack for all activities?
22 Ardi Manufacturing Company is in the process of preparing a budget for launching a
new product. The following table provides the associated activities and their
durations.

A. Draw the network diagram for the above table?

B. Find all paths in the diagram?
C. Find the critical path?

32
 D. Find the path slack?
E. Calculate the ES, EF, LS and LF times of each activities?
F. Calculate the activity slack for all activities?
23 Construct the project network comprised of activities A to L with the following
precedence relationships; Please specify activity times by yourself.

A. Find all paths in the diagram?

B. Find the critical path?
C. Find the path slack?
D. Calculate the ES, EF, LS and LF times of each activities?
E. Calculate the activity slack for all activities?

To construct the project network and answer the questions, let's first establish the
activity times and precedence relationships:

Activity times (in days):

 A: 3
 B: 2
 C: 4
 D: 5
 E: 2
 F: 3
 G: 1
 H: 2
 I: 4
 J: 3
 K: 2
 L: 1

Precedence relationships:

33
 A -> B
 A -> C
 B -> D
 C -> E
 D -> F
 E -> G
 F -> H
 G -> I
 H -> J
 I -> K
 J -> L
 K -> L

Let's construct the project network and answer the questions:

A. Find all paths in the diagram:

 Path 1: A -> B -> D -> F -> H -> J -> L

 Path 2: A -> B -> D -> F -> H -> J -> K -> L
 Path 3: A -> C -> E -> G -> I -> K -> L

B. Find the critical path:

 The critical path is Path 1: A -> B -> D -> F -> H -> J -> L, with a total duration of 3 + 2
+ 5 + 3 + 2 + 2 + 1 = 18 days.

C. Find the path slack:

 Path 1 Slack: 0 days

 Path 2 Slack: 1 day (Total duration - Duration of Path 2 = 18 - 17)
 Path 3 Slack: 2 days (Total duration - Duration of Path 3 = 18 - 16)

D. Calculate the ES, EF, LS, and LF times of each activity:

Activity ES EF LS LF
A 0 3 0 3
B 3 5 3 5
C 0 4 0 4
D 5 10 5 10
E 4 6 4 6

34
 Activity ES EF LS LF
F 10 13 10 13
G 6 7 6 7
H 13 16 13 16
I 7 11 7 11
J 16 18 16 18
K 11 13 11 13
L 18 19 18 19

E. Calculate the activity slack for all activities:

Activity Slack
A 0
B 0
C 0
D 0
E 0
F 0
G 1
H 0
I 0
J 0
K 0
L 0

These calculations provide insight into the project's critical path, the flexibility in non-
critical paths, and the earliest and latest start and finish times for each activity

24 Construct the project network comprised of activities A to P that satisfies the

following precedence relationships: Please specify activity times by yourself.

35
 A. Find all paths in the diagram?
B. Find the critical path?
C. Find the path slack?
D. Calculate the ES, EF, LS and LF times of each activities?
E. Calculate the activity slack for all activities?

+----> B ----+----> D ----+----> G ----+----> H ----+----> C ----+----> J ----+----> P

/ | | | | | |

/ | | | | | +----> L ----+----> O

/ | | | | | | |

/ | | | | | | +----> I ----+----> M ----

+----> N

/ | | | | | | | | |

A +----> E ----+----> F ----+----> J ----+----> H ----+----> G ----+ |

| |

\ \ | | |

\ +------------------------------------------+ |
|

\ | |

+-------------------------------------------------------> H
------------------------------------------------+ |

36
 |

+----> K
----> P

A. Find all paths in the diagram:

 There are multiple paths in the diagram. Here are some of them:
1. A -> B -> D -> G -> H -> C -> J -> P
2. A -> E -> F -> J -> H -> G -> J -> P
3. A -> E -> F -> H -> G -> J -> P
4. A -> E -> F -> J -> H -> G -> J -> P
5. A -> E -> F -> J -> H -> G -> H -> C -> J -> P
6. A -> E -> F -> J -> H -> C -> J -> P
7. A -> E -> F -> J -> H -> G -> H -> C -> J -> P
8. A -> E -> F -> J -> H -> C -> H -> C -> J -> P
9. A -> E -> F -> J -> H -> C -> J -> H -> C -> J -> P 10. A -> E -> F -> J -
> H -> C -> J -> H -> C -> J -> P (Please note that these are just some
examples, and there may be other paths as well.)

B. Find the critical path:

 The critical path is the longest path in the network, and it determines the
minimum project duration. In this case, the critical path is: A -> E -> F -> J ->
H -> G -> H -> C -> J -> P

C. Find the path slack:

 Path slack refers to the amount of time a path can be delayed without
delaying the project completion. To find path slack, we need to calculate the
total duration of each path and compare it to the duration of the critical path.
Paths that have the same duration as the critical path have zero slack.

D. Calculate the ES, EF, LS, and LF times of each activity:

37
 ES (Earliest Start Time): The earliest time an activity can start without delaying
the project.
 EF (Earliest Finish Time): The earliest time an activity can finish.
 LS (Latest Start Time): The latest time an activity can start without delaying the
project completion.
 LF (Latest Finish Time): The latest time an activity can finish without delaying
the project completion.

E. Calculate the activity slack for all activities:

 Activity slack refers to the amount of time an activity can be delayed without
delaying the project completion. It is calculated by taking the difference
between the LS and ES times or the LF and EF times.

To provide specific values for ES, EF, LS, LF, and activity slack, we need
additional information such as activity durations and dependencies. Once we
have that information, we can perform forward and backward pass
calculations to determine these values for each activity. Let me know if you
need further assistance with these calculations.

38