Pages that link to "Item:Q1890945"

The following pages link to A global optimization algorithm for linear fractional and bilinear programs (Q1890945):

Displaying 26 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
• Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
• Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
• Three enhancements for optimization-based bound tightening (Q522269) (← links)
• Generating sum-of-ratios test problems in global optimization (Q597195) (← links)
• On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
• BranchHull: convex bilinear inversion from the entrywise product of signals with known signs (Q778035) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem (Q881518) (← links)
• Global solution of optimization problems with signomial parts (Q924639) (← links)
• A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
• Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
• A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
• Safe and tight linear estimators for global optimization (Q1774166) (← links)
• Fair transfer price and inventory holding policies in two-enterprise supply chains (Q1848406) (← links)
• A global optimization algorithm for linear fractional and bilinear programs (Q1890945) (← links)
• Using conical partition to globally maximizing the nonlinear sum of ratios (Q1957316) (← links)
• An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
• On generalized surrogate duality in mixed-integer nonlinear programming (Q2118119) (← links)
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
• Multivariate McCormick relaxations (Q2250101) (← links)
• Enhanced linear reformulation for engineering optimization models with discrete and bounded continuous variables (Q2295318) (← links)
• A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
• Improve-and-branch algorithm for the global optimization of nonconvex NLP problems (Q2494301) (← links)
• A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints (Q5108220) (← links)