Gomory cuts in integer programming

Target entity: Gomory cuts in integer programming
Context triple: [Ralph E. Gomory, notableWork, Gomory cuts in integer programming]

• A. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• B. Gale’s theorem on flows with convex costs
  Gale’s theorem on flows with convex costs is a fundamental result in mathematical optimization and network flow theory that characterizes optimal flows in networks when the cost functions on edges are convex rather than linear.
• C. "Reducibility Among Combinatorial Problems" (1972)
  "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
• D. The Design and Analysis of Computer Algorithms
  The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
• E. Garey and Johnson: Computers and Intractability
  "Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Gomory cuts in integer programming
Target entity description: Gomory cuts in integer programming are a class of cutting-plane techniques that iteratively refine linear programming relaxations to find optimal integer solutions to mixed-integer optimization problems.

• A. Gale’s theorem on linear inequalities
  Gale’s theorem on linear inequalities is a fundamental result in convex geometry and linear programming that characterizes the solvability of systems of linear inequalities via an associated alternative system.
• B. Gale’s theorem on flows with convex costs
  Gale’s theorem on flows with convex costs is a fundamental result in mathematical optimization and network flow theory that characterizes optimal flows in networks when the cost functions on edges are convex rather than linear.
• C. "Reducibility Among Combinatorial Problems" (1972)
  "Reducibility Among Combinatorial Problems" (1972) is a landmark paper by Richard Karp that introduced NP-completeness to a broad audience by showing polynomial-time reductions among 21 classic combinatorial decision problems.
• D. The Design and Analysis of Computer Algorithms
  The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
• E. Garey and Johnson: Computers and Intractability
  "Garey and Johnson: Computers and Intractability" is a foundational textbook in theoretical computer science that systematically develops the theory of NP-completeness and computational complexity.
• F. None of above. chosen