1 / 28

Gomory’s cutting plane algorithm for integer programming

Gomory’s cutting plane algorithm for integer programming. Prepared by Shin-ichi Tanigawa. Rounding does not give any useful result. We first solve the LP-relaxation. Optimize using primal simplex method. Optimize using primal simplex method. Optimize using primal simplex method.

keona
Télécharger la présentation

Gomory’s cutting plane algorithm for integer programming

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Gomory’s cutting plane algorithm for integer programming Prepared by Shin-ichi Tanigawa

  2. Rounding does not give any useful result

  3. We first solve the LP-relaxation

  4. Optimize using primal simplex method

  5. Optimize using primal simplex method

  6. Optimize using primal simplex method

  7. The optimal solution is fractional

  8. Generating an objective row cut (1)

  9. Generating an objective row cut (1) (weakening)

  10. Generating an objective row cut (1) (weakening) (2) (for integers)

  11. Generating an objective row cut (1) (weakening) (2) (for integers) (2) - (1) Cutting plane is violated by current optimum solution

  12. Generating an objective row cut (1) (weakening) (2) (for integers) (2) - (1) (substitute for slacks)

  13. The first cutting plane:

  14. A new slack variable is added:

  15. The new cut is added to the dictionary

  16. Re-optimize using dual simplex method

  17. Re-optimize using dual simplex method

  18. A new fractional solution has been found

  19. Generating a constraint row cut (1)

  20. Generating a constraint row cut (1) (weaken)

  21. Generating a constraint row cut (1) (2) (valid for integers)

  22. Generating a constraint row cut (1) (2) (2) – (1)

  23. Generating a constraint row cut (1) (2) (2) – (1)

  24. The second cutting plane

  25. Add a new slack variable:

  26. The new cut is inserted into the optimum dictionary

  27. Re-optimize using dual simplex method

  28. The new optimum solution is integral

More Related