Define $x_1$ and $x_2$ as the number type $A$ and $B$ deals, respectively, then the problem can be formulated as the following LP:
\begin{align} \text{maximize} &\quad 20x_1 + 80x_2,\\
\text{subject to} &\quad x_1+x_2 \leq 20,\\ &\quad x_1 + 5x_2 \leq 60,\\
&\quad x_1,x_2\geq 0.
\end{align}
Converting this to standard form:
\begin{align} \text{minimize} &\quad -20x_1 - 80x_2,\\
\text{subject to} &\quad x_1+x_2 +x_3 = 20,\\ &\quad x_1 + 5x_2 +x_4= 60,\\
&\quad x_1,x_2,x_3, x_4\geq 0,
\end{align}
then we can solve this using the simplex algorithm.
First, form the tableau:
$$
T = \begin{pmatrix}
1 & 1 & 1 & 0 & 20\\
1 & 5 & 0 & 1 & 60\\
-20 & -80 & 0 & 0 & 0
\end{pmatrix},
$$
then apply pivoting (the pivots are indicated by squares):
$$
\begin{pmatrix}
1 & 1 & 1 & 0 & 20\\
1 & \fbox{5} & 0 & 1 & 60\\
-20 & -80 & 0 & 0 & 0
\end{pmatrix} \to
\begin{pmatrix}
1 & 1 & 1 & 0 & 20\\
1/5 & 1 & 0 & 1/5 & 12\\
-20 & -80 & 0 & 0 & 0
\end{pmatrix} \to
\begin{pmatrix}
\fbox{4/5} & 0 & 1 & -1/5 & 8\\
1/5 & 1 & 0 & 1/5 & 12\\
-4 & 0 & 0 & 16 & 960
\end{pmatrix} \to
\begin{pmatrix}
1 & 0 & 5/4 & -1/4 & 10\\
1/5 & 1 & 0 & 1/5 & 12\\
-4 & 0 & 0 & 16 & 960
\end{pmatrix} \to
\begin{pmatrix}
1 & 0 & 5/4 & -1/4 & 10\\
0 & 1 & -1/4 & 1/4 & 10\\
0 & 0 & 5 & 15 & 1000
\end{pmatrix},
$$
so the number of type $A$ and $B$ deals that maximize profit is $x_1=x_2=10$, respectively, with a profit of $1000$.
Selling 1 pair of shoes + 1 shirt x 4 = $80, which is the same profit as selling 1 pair of shoes + 5 shirts. However, you’ve sold 4 pair of shoes and 4 shirts in the prior case while selling 1 pair of shoes and 5 shirts in the later. Since the profit of selling 3 shoes is identical to selling one shirt, there is no advantage in one or the other except in terms of stock - allowing for more or less sales.
To maximize profits, maximize # of sales
– Ryan Pierce Williams Apr 11 '23 at 18:51