How to Solve Integer Linear Programming using Cutting Plane Part 3A

This video explains the step-by-step solution of solving Integer Linear Programming using the Cutting Plane Method. The third part shows the predetermination of optimal solution using the simplex method. The next video shows the usage of fractional "Gomory" cut and dual simplex method to solve for the optimal integer solution. Enjoy learning!
If you happen to understand the video, please like the video and subscribe to this channel "5-Minute Tutorials".

[calotropis_plant]

Maximize Z = 2x, + 2x2

Subject to the constraints 5x1+ 3x2 ≤58

X1 + 2x2 ≥ 4; x1, x1, x2 ≥ 0 are integers.
Can you solve this please

[allencymba]

I thought you are going to do both simplex and cutting plane in the same video in 5mins.