Constructive Dual Methods for Nonlinear Discrete Programming Problems
| Autor(a) principal: | |
|---|---|
| Data de Publicação: | 1987 |
| Outros Autores: | |
| Tipo de documento: | Artigo |
| Idioma: | eng |
| Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
| Texto Completo: | http://hdl.handle.net/10362/83866 |
Resumo: | This paper is primarily concerned with the extension of the bound improving sequence algorithm (Bárcia, 1985, 1987) to nonlinear discrete programming problems. Our attention is then focused to quadratic constrained binary problems. It is shown that for a particular class of these problems a computationally efficient algorithm is derived from the general approach. |