Skip to main content

Adaptive Monte Carlo Method for Solving Constrained Minimization Problem in Integer Non-Linear Programming

  • Chapter
Optimization Techniques IFIP Technical Conference

Part of the book series: Lecture Notes in Computer Science ((LNCIS))

Abstract

We consider the non-linear integer programming where the objective function is non-linear, but the constraint is linear.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ichimura, M., Wakimoto, K. (1975). Adaptive Monte Carlo Method for Solving Constrained Minimization Problem in Integer Non-Linear Programming. In: Marchuk, G.I. (eds) Optimization Techniques IFIP Technical Conference. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-38527-2_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-38527-2_46

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-37713-0

  • Online ISBN: 978-3-662-38527-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics