Skip to main content

Modified Filled Function Method for Global Discrete Optimization

  • Conference paper
  • First Online:
Advances in Global Optimization

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 95))

  • 2131 Accesses

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.

The National Natural Science Foundation of China (No. 10971053).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ge, R.P.: A filled function method for finding a global minimizer of a function of several variables. Math. Program. 46, 191–204 (1990)

    Article  MATH  Google Scholar 

  2. Levy, A.V., Montalvo, A.: The tunneling algorithm for the global minimization of function. SIAM J. Sci. Stat. Comput. 6(1), 15–29 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ge, R.P., Qin, Y.F.: The global convexized filled functions for globally optimization. Appl. Math. Comput. 35, 131–158 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  4. Lucid, S., Piccialli, V.: New classes of globally convexized filled functions for global optimization. J. Glob. Optim. 24, 219–236 (2002)

    Article  Google Scholar 

  5. Ge, R.P., Qin, Y.F.: A class of filled functions for finding a global minimizer of a function of several variables. J. Optim. Theory Appl. 54(2), 241–252 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhang, L.S., Ng, C., Li, D., Tian, W.W.: A new filled function method for global optimization. J. Glob. Optim. 28, 17–43 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Ge, R.P., Huang, H.: A continuous approach to nonlinear integer programming. Appl. Math. Comput. 34, 39–60 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  8. Zhang, L.S., Gao, F., Yao, Y.R.: Continuity methods for nonlinear integer programming. OR Trans. 2(2), 59–66 (1998)

    Google Scholar 

  9. Zhu, W.X.: A filled function method for nonlinear integer programming. Chin. Acta Math. Appl. Sin. 23(4), 481–487 (2000)

    MATH  Google Scholar 

  10. Hui, H.: An improved response time-constrained MINLP model of supply chain network design. In: LISS 2011-International Conference on Logistics, Informatics and Services Science, pp. 154–157 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to You-Lin Shang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Shang, YL., Sun, ZY., Jiang, XY. (2015). Modified Filled Function Method for Global Discrete Optimization. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_7

Download citation

Publish with us

Policies and ethics