Pages that link to "Item:Q1410241"

The following pages link to Generalized convex disjunctive programming: Nonlinear convex hull relaxation (Q1410241):

Displaying 37 items.

• Solving disjunctive optimization problems by generalized semi-infinite optimization techniques (Q301738) (← links)
• Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
• A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Mixed-integer nonlinear programs featuring ``on/off'' constraints (Q453616) (← links)
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• On optimality and duality theorems of nonlinear disjunctive fractional minmax programs (Q872111) (← links)
• A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming (Q949520) (← links)
• An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
• Quasiconvex minimization on a locally finite union of convex sets (Q956610) (← links)
• Global optimization of disjunctive programs (Q1679482) (← links)
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Constraint qualification failure in action (Q1694785) (← links)
• Safe and tight linear estimators for global optimization (Q1774166) (← links)
• Centered solutions for uncertain linear equations (Q1789636) (← links)
• Convex envelopes generated from finitely many compact convex sets (Q1942266) (← links)
• A comparison of solution approaches for the numerical treatment of or-constrained optimization problems (Q1986109) (← links)
• Between steps: intermediate relaxations between big-M and convex hull formulations (Q2117230) (← links)
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
• A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
• Globally optimal solutions of max-min systems (Q2426673) (← links)
• On the optimality of nonlinear fractional disjunctive programming problems (Q2519626) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
• A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites (Q2676349) (← links)
• (Q2861546) (← links)
• Perspective Reformulation and Applications (Q2897294) (← links)
• Perspective Reformulations of the CTA Problem with <i>L</i>₂ Distances (Q2931708) (← links)
• Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
• Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
• Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective (Q5057987) (← links)
• A computational study of perspective cuts (Q6062884) (← links)
• Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)