A Generalised Bound Improvement Sequence Algorithm
In this paper we present a generalization and a computational improvement of the Bound Improvement Sequence Algorithm. The main computational burden of this algorithm consists in determining whether there exists a feasible point on the objective hyperplane, when the algorithm encounters a fixed poin...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | workingPaper |
| Idioma: | eng |
| Publicado em: |
2019
|
| Texto completo: | http://hdl.handle.net/10362/83767 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/83767 |