) Find the dual program of the following linear programming problem.
𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑃 = 16𝑥 − 2𝑦 − 5𝑧
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜
𝑥 + 4𝑦 − 𝑧 ≥ 120
𝑥 + 𝑦 + 3𝑧 ≤ 130
𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 𝑖𝑠 𝑢𝑛𝑟𝑒𝑠𝑡𝑟𝑖𝑐𝑡𝑒𝑑.
All constraints can be converted to by multiplying by -1. So we have;
Since the primal has three variables and two constraints, then the dual will have two variables and three constraints. Also, the variable is unrestricted in the primal, therefore the third constraint in the dual shall be equality.
Dual program is;
Comments