A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
From MaRDI portal
Publication:2375741
DOI10.1155/2013/984168zbMath1266.90126OpenAlexW2084611946WikidataQ59007343 ScholiaQ59007343MaRDI QIDQ2375741
Publication date: 14 June 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/984168
Related Items
A branch-bound cut technique for non-linear fractional multi-objective optimization problems ⋮ Unnamed Item ⋮ Continuous Variable Neighborhood Search (C-VNS) for Solving Systems of Nonlinear Equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Linearization method for a class of multiplicative programming with exponent
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- Global maximization of a generalized concave multiplicative function
- Constrained global optimization: algorithms and applications
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Optimization on low rank nonconvex structures
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global optimization of multiplicative programs
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Introduction to global optimization
- Finite algorithm for generalized linear multiplicative programming
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Generalized linear multiplicative and fractional programming
- A method of acceleration for a class of multiplicative programming problems with exponent
- \(NP\)-hardness of linear multiplicative programming and related problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- A bilinear programming formulation of the 3-dimensional assignment problem
- A linear max—min problem
- Robust Optimization of Large-Scale Systems
- Equilibrium Points of Bimatrix Games
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Convex analysis and global optimization
This page was built for publication: A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
