Generalized convex disjunctive programming: Nonlinear convex hull relaxation
From MaRDI portal
Publication:1410241
DOI10.1023/A:1025154322278zbMath1030.90069OpenAlexW1542918674MaRDI QIDQ1410241
Ignacio E. Grossmann, Sang Bum Lee
Publication date: 14 October 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1025154322278
Convex programming (90C25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items
Perspective Reformulation and Applications, Solving disjunctive optimization problems by generalized semi-infinite optimization techniques, Pyomo.GDP: an ecosystem for logic based modeling and optimization development, A review of recent advances in global optimization, Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective, Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound, Perspective reformulations of mixed integer nonlinear programs with indicator variables, Cutting Plane Algorithm for Convex Generalized Disjunctive Programs, Perspective Reformulations of the CTA Problem with L2 Distances, On optimality and duality theorems of nonlinear disjunctive fractional minmax programs, Global optimization of disjunctive programs, A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function, A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites, Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem, A computational study of perspective cuts, Extended formulations in mixed integer conic quadratic programming, Constraint qualification failure in action, Globally optimal solutions of max-min systems, Convex envelopes generated from finitely many compact convex sets, A hierarchy of relaxations for linear generalized disjunctive programming, Comparison of MINLP formulations for global superstructure optimization, A hierarchy of relaxations for nonlinear convex generalized disjunctive programming, Mixed-integer nonlinear programs featuring ``on/off constraints, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, A comparison of solution approaches for the numerical treatment of or-constrained optimization problems, Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques, A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming, An algorithmic framework for convex mixed integer nonlinear programs, Quasiconvex minimization on a locally finite union of convex sets, Unnamed Item, Safe and tight linear estimators for global optimization, Centered solutions for uncertain linear equations, On the optimality of nonlinear fractional disjunctive programming problems, Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching, Between steps: intermediate relaxations between big-M and convex hull formulations, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems
Uses Software
