An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
From MaRDI portal
(Redirected from Publication:1567067)
Recommendations
- An outcome space approach for generalized convex multiplicative programs
- A new global optimization approach for convex multiplicative programming
- A convex analysis approach for convex multiplicative programming
- An outcome space branch-and-bound algorithm for a class of linear multiplicative programming problems
- An objective space cut and bound algorithm for convex multiplicative programmes
Cited in
(34)- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- Global optimization of linear multiplicative programming using univariate search
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A new global optimization approach for convex multiplicative programming
- A nonisolated optimal solution of general linear multiplicative programming problems
- A FPTAS for a class of linear multiplicative problems
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- An outcome-space finite algorithm for solving linear multiplicative programming
- Global optimization algorithm for the nonlinear sum of ratios problem
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Global optimization method for linear multiplicative programming
- A convex analysis approach for convex multiplicative programming
- An objective space cut and bound algorithm for convex multiplicative programmes
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- An integrated approach to redundancy allocation and test planning for reliability growth
- A new two-level linear relaxed bound method for geometric programming problems
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- An outcome space approach for generalized convex multiplicative programs
- Global optimization of nonlinear sums of ratios
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Solving generalized convex multiobjective programming problems by a normal direction method
- Fractional programming with convex quadratic forms and functions
- Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- An outcome space algorithm for minimizing the product of two convex functions over a convex set
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
- An outcome-space normal cone method for generalized concave multiplicative problems
This page was built for publication: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567067)
