Pages that link to "Item:Q969745"
From MaRDI portal
The following pages link to An outcome space approach for generalized convex multiplicative programs (Q969745):
Displaying 21 items.
- Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
- On the solution of generalized multiplicative extremum problems (Q635793) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- Generalized convex multiplicative programming via quasiconcave minimization (Q1359123) (← links)
- A finite algorithm for a class of nonlinear multiplicative programs (Q1422889) (← links)
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- An outcome space algorithm for minimizing the product of two convex functions over a convex set (Q1950065) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← 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)
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← 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)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
