An improved test set approach to nonlinear integer problems with applications to engineering design.

Saved in:

Bibliographic Details
Title:	An improved test set approach to nonlinear integer problems with applications to engineering design.
Authors:	Gago-Vargas, J.¹ gago@us.es, Hartillo, I.² hartillo@us.es, Puerto, J.³ puerto@us.es, Ucha, J.¹ ucha@us.es
Source:	Computational Optimization & Applications. Nov2015, Vol. 62 Issue 2, p565-588. 24p.
Subjects:	Engineering design, Communication in engineering design, Methodology, Integer programming, Mathematical programming
Abstract:	Many problems in engineering design involve the use of nonlinearities and some integer variables. Methods based on test sets have been proposed to solve some particular problems with integer variables, but they have not been frequently applied because of computation costs. The walk-back procedure based on a test set gives an exact method to obtain an optimal point of an integer programming problem with linear and nonlinear constraints, but the calculation of this test set and the identification of an optimal solution using the test set directions are usually computationally intensive. In problems for which obtaining the test set is reasonably fast, we show how the effectiveness can still be substantially improved. This methodology is presented in its full generality and illustrated on two specific problems: (1) minimizing cost in the problem of scheduling jobs on parallel machines given restrictions on demands and capacity, and (2) minimizing cost in the series parallel redundancy allocation problem, given a target reliability. Our computational results are promising and suggest the applicability of this approach to deal with other problems with similar characteristics or to combine it with mainstream solvers to certify optimality. [ABSTRACT FROM AUTHOR]
	Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Many problems in engineering design involve the use of nonlinearities and some integer variables. Methods based on test sets have been proposed to solve some particular problems with integer variables, but they have not been frequently applied because of computation costs. The walk-back procedure based on a test set gives an exact method to obtain an optimal point of an integer programming problem with linear and nonlinear constraints, but the calculation of this test set and the identification of an optimal solution using the test set directions are usually computationally intensive. In problems for which obtaining the test set is reasonably fast, we show how the effectiveness can still be substantially improved. This methodology is presented in its full generality and illustrated on two specific problems: (1) minimizing cost in the problem of scheduling jobs on parallel machines given restrictions on demands and capacity, and (2) minimizing cost in the series parallel redundancy allocation problem, given a target reliability. Our computational results are promising and suggest the applicability of this approach to deal with other problems with similar characteristics or to combine it with mainstream solvers to certify optimality. [ABSTRACT FROM AUTHOR]
ISSN:	09266003
DOI:	10.1007/s10589-015-9739-3