Question: 8. Find the optimal solution to the following integer programming problem, using Gomory's cutting plane method. Given below is the optimal tableau of the associated
8. Find the optimal solution to the following integer programming problem, using Gomory's cutting plane method.

Given below is the optimal tableau of the associated Linear Programme, with no restriction on the integrality of x' s.

Maximise Subject to Z=7x + 9x2 -x+3x2 LE 18 7x1 x2 LE 105 x and x2 to be non-negative integers LE means "less than or equal to"
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
