@thesis{thesis,
		author={Bu’ulölö  Faigiziduhu},
		title ={Pendekatan Pencarian Langsung Penyelesaian Problema Program Integer Tak Linier Campuran},
		year={2018},
		url={},
		abstract={It is well understood that integer programming is not a new subject in the field of optimization. Nevertheless, it is still an attractive field to be explored, spurred by the fact that its domain covers a wide range of important and challenging practical applications. However, given its practical applicability, we face computational difficulties in solving the integer programming problems effectively, particularly for large scale problems.
This dissertation addresses computational aspects of solving large scale nonlinear integer programming problems, with emphasis on the class of mixed integer problems. The basic idea is to release a nonbasic variable, found in the continuous optimal solution in such a way that will force a corresponding non-integer basic variable to take its neighbourhood integer value. The notion of superbasic is exploited in order to maintain integer feasibility. The strategy of choosing nonbasic variables in the integrizing process is based on minimizing the deririoration of the optimal continuous solution.
For a mixed integer linear programming problems, a ratio test is used in order to keep the integer result in the feasible region. In the nonlinear case, besides this ratio test, a feasibility check is used in a way to make sure the variables still satisfy the constraints of the problem.
Computational experience with this approach is described for solving a large scale problem. The result shows that the proposed strategy is promising in tackling certain classes of mixed integer programming problems.}
		}