dc.creator | Gago Vargas, Manuel Jesús | |
dc.creator | Hartillo Hermoso, Isabel | |
dc.creator | Puerto Albandoz, Justo | |
dc.creator | Ucha Enríquez, José María | |
dc.date.accessioned | 2015-10-15T06:54:08Z | |
dc.date.available | 2015-10-15T06:54:08Z | |
dc.date.issued | 2015-11 | |
dc.identifier.issn | ISSN: 0926-6003 (Print) 1573-2894 (Online) | es |
dc.identifier.uri | http://hdl.handle.net/11441/29474 | |
dc.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 | es |
dc.description.sponsorship | Junta de Andalucía FQM- 5849 | es |
dc.description.sponsorship | Ministerio de Ciencia e Innovación MTM2010-19336 | es |
dc.description.sponsorship | Ministerio de Ciencia e Innovación MTM2010-19576 | es |
dc.description.sponsorship | Ministerio de Ciencia e Innovación MTM2013-46962- C2-1-P | es |
dc.description.sponsorship | FEDER | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Springer | es |
dc.relation.ispartof | Computational Optimization and Applications, 62 (2), 565-588. | es |
dc.rights | Atribución-NoComercial-CompartirIgual 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.subject | Non-linear Integer Programming | es |
dc.subject | test set | es |
dc.subject | Gröbner basis | es |
dc.subject | chance constrained programming | es |
dc.title | An improved test set approach to nonlinear integer problems with applications to engineering design | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Álgebra | es |
dc.relation.publisherversion | http://link.springer.com/article/10.1007/s10589-015-9739-3 | es |
dc.identifier.doi | http://dx.doi.org/10.1007/s10589-015-9739-3 | es |
dc.journaltitle | Computational Optimization and Applications | es |
dc.publication.volumen | 62 | es |
dc.publication.issue | 2 | es |
dc.publication.initialPage | 565 | es |
dc.publication.endPage | 588 | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/29474 | |