This project involves solving integer linear programming problems using Gomory's cutting plane algorithm. For more detailed information, refer to the Cutting-plane method on Wikipedia.

Integer programming is a crucial branch of mathematical optimisation that focuses on problems where some or all decision variables are constrained to be integers. This field underpins many practical ...

Abstract: In this paper, a design framework based on integer linear programming is proposed for optimizing sparse array structures. We resort to binary vectors to formulate the design problem for ...

Abstract: This paper is about the primal-dual relationship in a mixed integer programming problem (MIP) in which integer variables are binary. It shows how the primal-dual relationship of a linear ...

Roughly, we will cover the following topics (some of them may be skipped depending on the time available). Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear ...

Write down the Linear Program (LP) relaxation of an IP Plot the graphical representation of an IP and find the optimal solution Understand the relationship between optimal solution of an IP and the ...