Pages that link to "Item:Q450102"
From MaRDI portal
The following pages link to Global minimization of a generalized linear multiplicative programming (Q450102):
Displaying 33 items.
- A branch-and-reduce approach for solving generalized linear multiplicative programming (Q410377) (← links)
- A new linearization method for generalized linear multiplicative programming (Q622153) (← links)
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Global minimization of a generalized convex multiplicative function (Q1315440) (← links)
- Global optimization of multiplicative programs (Q1404396) (← links)
- A parametric linearizing approach for quadratically inequality constrained quadratic programs (Q1644881) (← links)
- Range division and linearization algorithm for a class of linear ratios optimization problems (Q1713180) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← links)
- Finite algorithm for generalized linear multiplicative programming (Q1906745) (← links)
- Outer space branch and bound algorithm for solving linear multiplicative programming problems (Q2022174) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems (Q2088876) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- Global optimization reduction of generalized Malfatti's problem (Q2358905) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A simplex branch-and-bound method of a class of multi-product programming problems (Q2885973) (← links)
- Solving globally the linear multiplicative programming problem via monotonic functions (Q2916532) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- (Q3146104) (← links)
- Solving generalized polynomial problem by using new affine relaxed technique (Q5063453) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- Solving linear multiplicative programs via branch-and-bound: a computational experience (Q6060545) (← links)
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- A criterion space algorithm for solving linear multiplicative programming problems (Q6582405) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
