A global optimization approach for solving the convex multiplicative programming problem
From MaRDI portal
Publication:1200524
DOI10.1007/BF00130830zbMath0752.90056OpenAlexW2058558758MaRDI QIDQ1200524
Publication date: 16 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00130830
Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The optimal level solution method applied to a non linear programming problem with exponential objective function, An accelerating algorithm for globally solving nonconvex quadratic programming, Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Constraint decomposition algorithms in global optimization, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, An outcome-space finite algorithm for solving linear multiplicative programming, Multiplicative programming problems: Analysis and efficient point search heuristic, Decomposition approach for the global minimization of biconcave functions over polytopes, A branch-and-reduce approach to global optimization, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, 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, A branch-and-reduce approach for solving generalized linear multiplicative programming, An efficient algorithm for globally solving generalized linear multiplicative programming, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming, Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming, Global minimization of a generalized linear multiplicative programming, Global optimization for generalized linear multiplicative programming using convex relaxation, A global optimization approach for solving generalized nonlinear multiplicative programming problem, A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem, A convex analysis approach for convex multiplicative programming, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, An objective space cut and bound algorithm for convex multiplicative programmes, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A new global optimization approach for convex multiplicative programming, Duality for linear multiplicative programs, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, A nonisolated optimal solution of general linear multiplicative programming problems, \(NP\)-hardness of linear multiplicative programming and related problems, Outcome-space cutting-plane algorithm for linear multiplicative programming, Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems, 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
- Unnamed Item
- Unnamed Item
- On a class of quadratic programs
- Outer approximation by polyhedral convex sets
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- A parametric successive underestimation method for convex multiplicative programming problems
- Minimization of ratios
- Concave minimization under linear constraints with special structure
- On an outer approximation concept in global optimization
- A method for globally minimizing concave functions over convex sets
- An efficient solution method for rank two quasiconcave minimization problems
- Convex Analysis
