Keywords:-
Article Content:-
Abstract
The mixed integer nonlinear programming problem addressed in this paper refers to mathematical programming with continuous and discrete variables and linearities in the objective 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.
References:-
References
Grossmann and, I.E., Sahinidis, N.V (eds). 2002. Special Issue on Mixed-integer Programming and its Application to Engineering, Part I, Optim. Eng., 3 (4), Kluwer Academic Publishers, Netherlands
Tambunan, H., and Mawengkang, H. 2018. Integer Linear Programming Approach for Detection Learning Outcomes Achievement. Far East Journal of Mathematical and Sciences, 5(1), 95-109, 2018
Tambunan, H. 2017. Designing Multimedia Learning for Solving Linear Programming. Global Journal of Pure and Applied Mathematics, 12 (6). 5265-5281.
Tambunan, H. 2025.The Role of Multimedia for Solving Integer Linear Programming. International Journal of Mathematics and Computer Research, 13(6), 5342-5345.
Tambunan, H. 2022. A Mathematical Modeling for Education. AIP Conference Proceedings, 2577,020068-1-020068-6
Gupta, O.K; and Ravindran, V. 1985. Branch and Bound Experiments in Convex Nonlinear Integer Programming. Management Science, 31, 1533-1546.
Belotti, P., Lee, J, Liberti, L., Margot, F., and Wachter, A. 2009. Branching and Bounds Tightening Techniques for non-Convex MINLP, Optimization Methods and Software, 24(4):597-634.
Westerlund, T., and Petersson, F. 1995. A Cutting Plane Method for Solving Convex MINLP Problems, Computers Chem. Eng., 19, 131–136
Murtagh, B.A., and Sargent, R.W.H. 1969. A constrained minimization method with quadratic convergence, in: R. Fletcher, ed., Optimization (Academic Press, New York, 215-246.
Mawengkang, H., and Murtagh, B. A. 1986. Solving Nonlinear Integer Programs with Large-Scale Optimization Software. Annals of Operations Research 5425-437
Scarf, H. E. 1986. Testing for Optimality in the Absence of Convexity. In: Heller, W.P., Starr, R. M., and Starett, D. A (Eds) Cambridge University Press, 117-134
Tambunan, H., and Mawengkang, H. 2025. Neighbourhood Approach for Solving One Class of Mixed Integer Non-Linear Programming. International Journal of Mathematics and Computer Research, 13(1), 4727-4730.
Tambunan, H., and Mawengkang, H. 2016. Solving Mixed Integer Non-Linear Programming Using Active Constraint. Global Journal of Pure and Applied Mathematics, 13(7), 2965-2973.