Constructive Dual Methods for Nonlinear Discrete Programming Problems
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 computat...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2019
|
| Texto completo: | http://hdl.handle.net/10362/83866 |
| País: | Portugal |
| Oai: | oai:run.unl.pt: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. |
|---|