Abstract
The paper contains critical remarks on global optimisation algorithms published by R. Horst and N. V. Thoai.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Horst, R., Thoai, N. V.: Modification implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems. Computing42, 271–289 (1989).
Thoai, N. V.: On the construction of test problems for concave minimization algorithms. J. Global Optim.5, 399–402 (1994).
Author information
Authors and Affiliations
Additional information
Editor’s Note: In Computing42 (1989), we published an article ‘Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems’ by R. Horst and N. V. Thoai. On December 1, 1995 we received a manuscript of H. D. Tuan expressing doubts on the correctness of this paper. After some correspondence with the authors we received an Erratum from R. Horst and N. V. Thoai (see p. 94 of this issue) and the above modified version of H. D. Tuan’s objections. We decided to publish both communications and to leave it to the reader to form an opinion on this controversy. [R. F. Albrecht]
Rights and permissions
About this article
Cite this article
Tuan, H.D. Can linear programs be used to test global optimization algorithms?. Computing 59, 91–93 (1997). https://doi.org/10.1007/BF02684406
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02684406