Nonlinear integer programming and discrete optimization

Omprakash K. Gupta, A. Ravindran

Research output: Contribution to journalArticle

33 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)160-164
Number of pages5
JournalJournal of Mechanical Design, Transactions Of the ASME
Volume105
Issue number2
DOIs
StatePublished - Jan 1 1983

All Science Journal Classification (ASJC) codes

  • Mechanics of Materials
  • Mechanical Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Nonlinear integer programming and discrete optimization'. Together they form a unique fingerprint.

  • Cite this