Pages that link to "Item:Q1906745"
From MaRDI portal
The following pages link to Finite algorithm for generalized linear multiplicative programming (Q1906745):
Displaying 34 items.
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs (Q408205) (← links)
- Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
- A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
- A new accelerating method for globally solving a class of nonconvex programming problems (Q923946) (← links)
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions (Q992571) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657) (← links)
- Global minimization for generalized polynomial fractional program (Q1718667) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- An out space accelerating algorithm for generalized affine multiplicative programs problem (Q1794179) (← 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)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
- A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
- Global optimization of a rank-two nonconvex program (Q2379188) (← links)
- Global optimization algorithm for a generalized linear multiplicative programming (Q2511121) (← links)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems (Q2518145) (← links)
- Level set algorithm for solving convex multiplicative programming problems (Q2570801) (← links)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- On the minimization of a class of generalized linear functions on a flow polytope (Q2926471) (← links)
- An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402) (← links)
- An efficient algorithm for computing a class of multiplicative optimization problem (Q5069808) (← 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)
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems (Q6568950) (← links)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)
