Construct a pair of primal and dual problems, each with two decision variables and two functional constraints, such that the primal problem has no feasible solutions and the dual problem has an unbounded objective function.
Answer to relevant QuestionsUse the weak duality property to prove that if both the primal and the dual problem have feasible solutions, then both must have an optimal solution. Consider the following problem. Maximize Z = 6x1 + 8x2, Subject to and x1 ≥ 0, x2 ≥ 0. (a) Construct the dual problem for this primal problem. Reconsider the model of Prob. 6.1-3b. (a) Construct its dual problem. (b) Solve this dual problem graphically. For each of the following linear programming models, give your recommendation on which is the more efficient way (probably) to obtain an optimal solution: by applying the simplex method directly to this primal problem or by ...Consider the following problem. Maximize Z = x1 + 2x2, Subject to and x1 ≥ 0, x2 ≥ 0.
Post your question