Modified filled function method for global discrete optimization

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a modified definition of the filled function for discrete nonlinear programming problem and give a filled function satisfying our definition. The properties of the proposed filled function and the method using this filled function to solve discrete nonlinear programming problem are discussed in this paper. The results of preliminary numerical experiments are also reported.

Cite

CITATION STYLE

APA

Shang, Y. L., Sun, Z. Y., & Jiang, X. Y. (2015). Modified filled function method for global discrete optimization. In Springer Proceedings in Mathematics and Statistics (Vol. 95, pp. 57–68). Springer New York LLC. https://doi.org/10.1007/978-3-319-08377-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free