A Novel MINLP Reformulation for Nonlinear Generalized Disjunctive Programming (GDP) Problems
Anshul Agarwal

TL;DR
This paper introduces a new exact reformulation method for nonlinear generalized disjunctive programming (GDP) problems, enabling their conversion into standard MINLP problems without approximation or additional parameters, thus improving modeling and solution efficiency.
Contribution
The paper presents a novel reformulation technique for nonlinear GDP problems that preserves feasibility and convexity, avoiding the use of Big-M parameters and tolerances, and extends to complex logical constructs.
Findings
Exact reformulation of nonlinear GDP into MINLP
Preserves feasibility and convexity of constraints
Applicable to complex logical implications in optimization
Abstract
In optimization problems, often equations and inequalities are represented using if-else (implication) construct which is known to be equivalent to a disjunction. Such statements are modeled and incorporated in an optimization problem using Generalized Disjunctive Programming (GDP). GDP provides a systematic methodology to model optimization problems involving logic disjunctions, logic propositions, and algebraic equations. In order to take advantage of the existing MINLP solvers, GDP problems can be reformulated as the standard MINLP problems. In this work we propose a novel reformulation methodology for general GDP problems with nonlinear equality and inequality constraints. The proposed methodology provides an exact reformulation, maintains feasibility and convexity of the constraints, and, most importantly, does not require choosing a tolerance level and a Big-M parameter. We also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProcess Optimization and Integration · Advanced Control Systems Optimization · Optimization and Mathematical Programming
