NONLINEAR MIXED INTEGER PROGRAMMING AND DISCRETE OPTIMIZATION.

O. K. Gupta, Arunachalam Ravindran

Research output: Contribution to journalConference article

5 Citations (Scopus)

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. The branch and bound method as applied to the integer case is described, and 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. A method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.

Original languageEnglish (US)
Pages (from-to)27-32
Number of pages6
JournalUnknown Journal
StatePublished - Jan 1 1981
EventPresented at the ASME Des Eng Tech Conf - Hartford, CT, USA
Duration: Sep 20 1981Sep 23 1981

Fingerprint

Branch and bound method
Integer programming

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Gupta, O. K. ; Ravindran, Arunachalam. / NONLINEAR MIXED INTEGER PROGRAMMING AND DISCRETE OPTIMIZATION. In: Unknown Journal. 1981 ; pp. 27-32.
@article{44be0d142113415bbf17e08a2e84b6a1,
title = "NONLINEAR MIXED INTEGER PROGRAMMING AND DISCRETE OPTIMIZATION.",
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. The branch and bound method as applied to the integer case is described, and 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. A method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.",
author = "Gupta, {O. K.} and Arunachalam Ravindran",
year = "1981",
month = "1",
day = "1",
language = "English (US)",
pages = "27--32",
journal = "[No source information available]",
issn = "0042-1215",

}

NONLINEAR MIXED INTEGER PROGRAMMING AND DISCRETE OPTIMIZATION. / Gupta, O. K.; Ravindran, Arunachalam.

In: Unknown Journal, 01.01.1981, p. 27-32.

Research output: Contribution to journalConference article

TY - JOUR

T1 - NONLINEAR MIXED INTEGER PROGRAMMING AND DISCRETE OPTIMIZATION.

AU - Gupta, O. K.

AU - Ravindran, Arunachalam

PY - 1981/1/1

Y1 - 1981/1/1

N2 - 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. The branch and bound method as applied to the integer case is described, and 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. A method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.

AB - 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. The branch and bound method as applied to the integer case is described, and 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. A method for extending the branch and bound principle to solve nonlinear discrete optimization problems is described.

UR - http://www.scopus.com/inward/record.url?scp=0019654449&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019654449&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0019654449

SP - 27

EP - 32

JO - [No source information available]

JF - [No source information available]

SN - 0042-1215

ER -