Pages that link to "Item:Q1200524"

The following pages link to A global optimization approach for solving the convex multiplicative programming problem (Q1200524):

Displaying 35 items.

• A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
• Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
• Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
• A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type (Q685859) (← links)
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
• An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
• A convex analysis approach for convex multiplicative programming (Q934807) (← links)
• A new global optimization approach for convex multiplicative programming (Q972168) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
• Constraint decomposition algorithms in global optimization (Q1342897) (← links)
• Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
• Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
• Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
• A branch-and-reduce approach to global optimization (Q1924068) (← links)
• A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem (Q1971990) (← links)
• Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
• Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
• An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← links)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
• The optimal level solution method applied to a non linear programming problem with exponential objective function (Q4522310) (← links)
• Duality for linear multiplicative programs (Q4673140) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)