This document discusses the duality of a linear programming problem and obtaining the dual problem. It provides an example primal problem with an unrestricted variable x3. To solve this, x3 is written as x31 - x32, making it restricted. The dual problem is then derived by associating dual variables with each primal constraint and writing the dual objective function and constraints. The dual problem is provided, along with combining two dual variables y3 and y4 into a single unrestricted variable y. In summary, the document provides an example of obtaining the dual of a primal LP problem with an unrestricted variable.