Chapter 6.3, Problem 1ED

Excluding the nonnegative constraints, the components of a linear programming problem can be divided into three categories: the coefficients of the objective function, the coefficients of the problem constraints, and the constant on the right side of the problem constraints. Write a verbal description of the relationship between the components of the original minimization problem $\left(1\right)$ and the dual maximization problem $\left(2\right)$.