Pages that link to "Item:Q1200524"
From MaRDI portal
The following pages link to A global optimization approach for solving the convex multiplicative programming problem (Q1200524):
Displayed 15 items.
- 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 outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← 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)
- 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)
- \(NP\)-hardness of linear multiplicative programming and related problems (Q2564608) (← 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)