TITLE:
Convexity Properties for a Function of Two Integer Variables
AUTHORS:
Sara Nourazari, Hillel Kumin
KEYWORDS:
Linear Integer Programming, Convexity
JOURNAL NAME:
American Journal of Operations Research,
Vol.11 No.6,
October
13,
2021
ABSTRACT: Sufficient
conditions are given for any local minimum of a function of two integer
variables to be a global minimum. An example is given to show that
a function of two integer variables need not be discrete convex for this
condition to hold.