Pages that link to "Item:Q1579657"
From MaRDI portal
The following pages link to Outcome-space cutting-plane algorithm for linear multiplicative programming (Q1579657):
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)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← 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 convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
- A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
- A new reduced gradient method for solving linearly constrained multiobjective optimization problems (Q1756580) (← 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)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection (Q2097485) (← links)
- Approximating a linear multiplicative objective in watershed management optimization (Q2098027) (← links)
- Global algorithm for solving linear multiplicative programming problems (Q2174910) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Global optimization method for linear multiplicative programming (Q2355349) (← links)
- Solving a class of generalized fractional programming problems using the feasibility of linear programs (Q2360402) (← 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 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)
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes (Q2790887) (← 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)
- Duality for linear multiplicative programs (Q4673140) (← links)
- Global Optimization of Linear Multiplicative Programming Using Univariate Search (Q4982140) (← 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 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)
