Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming

DOI10.1007/978-3-642-01929-6_16MaRDI QIDQ3630163zbMATH OpenOpenAlexFDO

Authors Sylvain Mouret, Ignacio E. Grossmann, Pierre Pestiaux

Publication date 3 June 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01929-6_16

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)

Recommendations

• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Convex relaxations for mixed-integer nonlinear programs
• Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
• Using two-dimensional projections for stronger separation and propagation of bilinear terms
• Branching and bounds tighteningtechniques for non-convex MINLP

Cited in

(5)

• Active-constraint variable ordering for faster feasibility of mixed integer linear programs
• Petri net-based approach to short-term scheduling of crude oil operations with less tank requirement
• scientific article; zbMATH DE number 3885661 (Why is no real title available?)
• scientific article; zbMATH DE number 27284 (Why is no real title available?)
• An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3630163)