Solution

The conversion of a primal linear programming problem to its dual problem is a standard technique in linear programming. Here's how it can be done:

1. Write the primal problem in standard form: Maximize the objective function subject to a set of constraints.
2. Create the dual problem by converting the primal constraints into dual variables and the primal objective function into the dual objective function. The constraints in the primal problem become the objective function in the dual problem, and the objective function in the primal problem becomes the constraints in the dual problem.
3. Replace each inequality constraint in the primal problem with an equality constraint, and each equality constraint with an inequality constraint.
4. Change the direction of the inequality constraints in the dual problem. If the primal constraint was a less-than-or-equal-to constraint, the dual constraint should be a greater-than-or-equal-to constraint, and vice versa.
5. Replace the primal variables with the dual variables, and vice versa.
6. Solve the dual problem to obtain the optimal dual variables, and then use these variables to obtain the optimal primal variables.

Therefore,  y1 ≥ 0, y2 ≥ 0