Pages that link to "Item:Q1042085"

The following pages link to Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085):

Displaying 9 items.

• Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
• On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← links)
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
• Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514) (← links)
• A deterministic approach to linear programs with several additional multiplicative constraints (Q1819156) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)