Pages that link to "Item:Q1724645"
From MaRDI portal
The following pages link to A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645):
Displaying 16 items.
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- Global optimization of multiplicative programs (Q1404396) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- Reverse polyblock approximation for generalized multiplicative/fractional programming (Q1762797) (← links)
- A deterministic approach to linear programs with several additional multiplicative constraints (Q1819156) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems (Q2075981) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization (Q2494289) (← links)
- (Q3146104) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128) (← links)