Pages that link to "Item:Q439452"

The following pages link to A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452):

Displaying 10 items.

• Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
• Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
• Global optimization of disjunctive programs (Q1679482) (← links)
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← 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)
• Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
• A disjunctive model to analyze and redefine the logistic of replenishing goods of retailing stores (Q6173769) (← links)
• Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones (Q6498414) (← links)