An outcome space approach for generalized convex multiplicative programs
From MaRDI portal
Publication:969745
DOI10.1007/s10898-009-9460-9zbMath1189.90126OpenAlexW1975788803MaRDI QIDQ969745
Rúbia M. Oliveira, Paulo Augusto Valente Ferreira
Publication date: 7 May 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9460-9
Related Items (9)
Global optimization algorithm for solving linear multiplicative programming problems ⋮ Global algorithm for solving linear multiplicative programming problems ⋮ An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming ⋮ On the solution of generalized multiplicative extremum problems ⋮ Global minimization of a generalized linear multiplicative programming ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Active constraints, indefinite quadratic test problems, and complexity
- Global maximization of a generalized concave multiplicative function
- A convex analysis approach for convex multiplicative programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Generalized convex multiplicative programming via quasiconcave minimization
- Global optimization of multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Introduction to global optimization
- Generalized linear multiplicative and fractional programming
- Convex analysis and global optimization
- Analysis of bounds for multilinear functions
- Global optimization of nonlinear sums of ratios
This page was built for publication: An outcome space approach for generalized convex multiplicative programs
