Given the following linear programming problem and the simplex tableau (Table 4.5)

containing the solution to it, (i) formulate the dual to the given problem, and (ii) obtain the solution to the dual from the tableau. Also verify that the objective function values of both the problems are same.

Transcribed Image Text:

Minimise Z = x + x2 Subject to 6x + 2x2 24 3x + 2x2 18 x + 3x212 X1, X2 0