Outcome-space cutting-plane algorithm for linear multiplicative programming
From MaRDI portal
Publication:1579657
DOI10.1023/A:1004657629105zbMath0962.90024OpenAlexW61717321MaRDI QIDQ1579657
Publication date: 14 September 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1004657629105
global optimizationnonconvex programmingcutting planemultiplicative programmingoutcome spaceextreme-point search
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving a class of generalized fractional programming problems using the feasibility of linear programs, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, A method of acceleration for a class of multiplicative programming problems with exponent, A FPTAS for a class of linear multiplicative problems, An outcome-space finite algorithm for solving linear multiplicative programming, An efficient algorithm for computing a class of multiplicative optimization problem, Linearization method for a class of multiplicative programming with exponent, Global optimization algorithm for solving linear multiplicative programming problems, Global algorithm for solving linear multiplicative programming problems, An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems, Global algorithm for a class of multiplicative programs using piecewise linear approximation technique, A new linearization method for generalized linear multiplicative programming, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, A branch-and-reduce approach for solving generalized linear multiplicative programming, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming, A global optimization approach for solving generalized nonlinear multiplicative programming problem, A convex analysis approach for convex multiplicative programming, An objective space cut and bound algorithm for convex multiplicative programmes, A new reduced gradient method for solving linearly constrained multiobjective optimization problems, Duality for linear multiplicative programs, Outer space branch and bound algorithm for solving linear multiplicative programming problems, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes, Global optimization algorithm for a generalized linear multiplicative programming, An out space accelerating algorithm for generalized affine multiplicative programs problem, A branch and bound algorithm for globally solving a class of nonconvex programming problems, A nonisolated optimal solution of general linear multiplicative programming problems, Global Optimization of Linear Multiplicative Programming Using Univariate Search, Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection, Approximating a linear multiplicative objective in watershed management optimization, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints, Global optimization method for linear multiplicative programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- Linear multiplicative programming
- Image space analysis of generalized fractional programs
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Finite algorithm for generalized linear multiplicative programming
- A branch-and-reduce approach to global optimization
- Generalized linear multiplicative and fractional programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- An efficient solution method for rank two quasiconcave minimization problems
- Minimizing the sum of a convex function and the product of two affine functions over a convex set
- A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
- Convex Analysis
