RESEARCH PAPERS: Design Automation Papers

Nonlinear Integer Programming and Discrete Optimization

[+] Author and Article Information
Omprakash K. Gupta

Indian Inst. of Management, Ahmedabad 15, India

A. Ravindran

School of Industrial Engineering, University of Oklahoma, Norman, Okla. 73019

J. Mech., Trans., and Automation 105(2), 160-164 (Jun 01, 1983) (5 pages) doi:10.1115/1.3258502 History: Received January 11, 1983; Online November 19, 2009


Branch and bound has been widely recognized as an effective method in solving linear integer programming problems. This paper presents a study on the feasibility of the branch and bound method in solving general nonlinear mixed integer programming and discrete optimization problems. First, a description of the branch and bound method as applied to the integer case is given. Next, a computer code BBNLMIP is developed to carry out an experimental study on 22 test problems. The numerical results indicate the effect of the problem parameters such as number of integer variables and constraints. Finally, a method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.

Copyright © 1983 by ASME
Your Session has timed out. Please sign back in to continue.






Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In