This is a preview. Log in through your library . Abstract A logarithmic-exponential dual formulation is proposed in this paper for bounded integer programming problems. This new dual formulation ...

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 ...

Every mixed integer programming problem is shown to be equivalent to an infinite number of other mixed integer programming problems. The optimal solution to any problem in a class determines the ...