Integer Processing for Mixed Integer Linear Programming Problems

The mixed integer nonlinear programming problem addressed in this paper refers to mathematical pro­gramming with continuous and discrete variables and linearities in the ob­jective function and constraints. The purpose of this article is to create an approach to solving MILP problems for integer search through active constraints, and neighborhoods, in order to reduce iterations. The study of the criteria for selecting non-basic variables for use in the integer processes has been conducted using active constraint and neighborhood approaches. The number of integration steps will be limited if the number of integer variables in the problem is finite. However, the integer processes not necessarily depend on the number of integer variables, as many integer variables may have integer values in a continuous optimal solution.