NDLI: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

Content Provider	Springer Nature Link
Author	Tawarmalani, Mohit Sahinidis, Nikolaos V.
Copyright Year	2003
Abstract	This work addresses the development of an efficient solution strategy for obtaining global optima of continuous, integer, and mixed-integer nonlinear programs. Towards this end, we develop novel relaxation schemes, range reduction tests, and branching strategies which we incorporate into the prototypical branch-and-bound algorithm. In the theoretical/algorithmic part of the paper, we begin by developing novel strategies for constructing linear relaxations of mixed-integer nonlinear programs and prove that these relaxations enjoy quadratic convergence properties. We then use Lagrangian/linear programming duality to develop a unifying theory of domain reduction strategies as a consequence of which we derive many range reduction strategies currently used in nonlinear programming and integer linear programming. This theory leads to new range reduction schemes, including a learning heuristic that improves initial branching decisions by relaying data across siblings in a branch-and-bound tree. Finally, we incorporate these relaxation and reduction strategies in a branch-and-bound algorithm that incorporates branching strategies that guarantee finiteness for certain classes of continuous global optimization problems. In the computational part of the paper, we describe our implementation discussing, wherever appropriate, the use of suitable data structures and associated algorithms. We present computational experience with benchmark separable concave quadratic programs, fractional 0–1 programs, and mixed-integer nonlinear programs from applications in synthesis of chemical processes, engineering design, just-in-time manufacturing, and molecular design.
Starting Page	563
Ending Page	591
Page Count	29
File Format	PDF
ISSN	00255610
Journal	Mathematical Programming
Volume Number	99
Issue Number	3
e-ISSN	14364646
Language	English
Publisher	Springer-Verlag
Publisher Date	2003-08-18
Publisher Place	Berlin, Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach

Perspective reformulations of mixed integer nonlinear programs with indicator variables

Global Optimization of Mixed-Integer Nonlinear Programs: A Theoretical and Computational Study (2003)

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

Lifting inequalities: a framework for generating strong cuts for nonlinear programs

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

On sublinear inequalities for mixed integer conic programs

An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems

A hierarchy of bounds for stochastic mixed-integer programs

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study

Similar Documents

Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach

Perspective reformulations of mixed integer nonlinear programs with indicator variables

Global Optimization of Mixed-Integer Nonlinear Programs: A Theoretical and Computational Study (2003)

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

Lifting inequalities: a framework for generating strong cuts for nonlinear programs

Convex quadratic relaxations for mixed-integer nonlinear programs in power systems

On sublinear inequalities for mixed integer conic programs

An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems

A hierarchy of bounds for stochastic mixed-integer programs

Global optimization of mixed-integer nonlinear programs: A theoretical and computational study