Neighbourhood Based Search Approach for Solving A Large Scale of NonConvex Mixed-Integer Non Linear Programming Problems

Abstract

Many methods of optimization involve an integer value element. This optimization is considered to be
integer programming. But this is not an optimizing new subject. Despite its functional applicability,
strategies for large-scale problems often have to be computationally challenging. In this paper, we solve a
class of mixed-integer non-linear programming problems by implementing a strategy to release non-basic
variables from their limits so that they can move into the neighborhood integer points in an optimal
continuous solution. Some of the computational experience is presented.