How to find optimal solution to dual given the optimal format of simplex equations?

Answered

Bekzod Akhmuratov

• October 30, 2023 06:18

I have the below exercise from the book that I can't figure out to solve.

From the provided equations (they represent constraints in standard and optimal format), I found that basic feasible solutions are {x₁=5/3, x2=0, x3=3). Dual of the problem follows:

Min 25y1+20y2
subject to 6y1+3y2 ≥ 3
3y1+4y2 ≥ 1
5y1+5y2 ≥ 4
y1, y2 ≥ 0

I thought I'll use complementary slackness to find optimal solution to dual, but it didn't work. Now I'm stuck

0

• 

  Mario Ruthmair

  Gurobi Staff

  • November 08, 2023 14:08

  Hi,

  In this community forum, we discuss Gurobi-specific topics and issues and do not solve LP exercises from textbooks. You can of course use Gurobi to verify the optimal solutions you found by hand.

  Best regards,
  Mario

  0

Please sign in to leave a comment.