An Improved Search Approach for Solving Non-Convex Mixed-Integer Non Linear Programming Problems

The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined w...

Full description

Saved in:

Bibliographic Details
Published in:	IOP conference series. Materials Science and Engineering 2018-01, Vol.300 (1), p.12022
Main Authors:	Sitopu, Joni Wilson, Mawengkang, Herman, Lubis, Riri Syafitri
Format:	Article
Language:	eng
Subjects:	active constraints Algorithms Continuity (mathematics) direct search global optimization Linear programming Mathematical analysis Mathematical programming Mixed integer Nonlinear programming
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	The nonlinear mathematical programming problem addressed in this paper has a structure characterized by a subset of variables restricted to assume discrete values, which are linear and separable from the continuous variables. The strategy of releasing nonbasic variables from their bounds, combined with the "active constraint" method, has been developed. This strategy is used to force the appropriate non-integer basic variables to move to their neighbourhood integer points. Successful implementation of these algorithms was achieved on various test problems.
ISSN:	1757-8981 1757-899X