A nonisolated optimal solution of general linear multiplicative programming problems
type: Item
instance of: scholarly article
title: A nonisolated optimal solution of general linear multiplicative programming problems
zbMATH Open document ID: 1179.90262
published in: Computers \& Operations Research
publication date: 2009-04-03T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5539857
zbMATH Keywords: general linear multiplicative programming
zbMATH Keywords: global optimization
zbMATH Keywords: nonconvex optimization
zbMATH Keywords: nonisolated optimal solution
zbMATH Keywords: branch-and-bound
author: Yongqiang Chen
author: Hong-Wei Jiao
MaRDI profile type: Publication
full work available at URL: j.cor.2008.11.002
OpenAlex ID: W2069847787
cites work: Q5630793
cites work: A mean-absolute deviation-skewness portfolio optimization model
cites work: Solving long-term financial planning problems via global optimization
cites work: Q4352213
cites work: Q3950274
cites work: Robust Optimization of Large-Scale Systems
cites work: Bilinear separation of two sets in \(n\)-space
cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
cites work: Global minimization of a generalized convex multiplicative function
cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems
cites work: A global optimization approach for solving the convex multiplicative programming problem
cites work: A branch-and-reduce approach to global optimization
cites work: Global optimization of multiplicative programs
cites work: Solving a class of multiplicative programs with 0-1 knapsack constraints
cites work: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
cites work: A finite branch-and-bound algorithm for linear multiplicative programming
cites work: An outcome-space finite algorithm for solving linear multiplicative programming
cites work: An outer approximation method for minimizing the product of several convex functions on a convex set
cites work: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
cites work: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
cites work: Outcome-space cutting-plane algorithm for linear multiplicative programming
cites work: Multiplicative programming problems: Analysis and efficient point search heuristic
cites work: Heuristic methods for linear multiplicative programming
cites work: Monotonic optimization: Problems and solution approaches
cites work: Monotonic Optimization: Branch and Cut Methods
DOI: 10.1016/J.COR.2008.11.002
Recommended article: A global optimization approach for solving generalized nonlinear multiplicative programming problem
Recommended article: A finite algorithm for a class of nonlinear multiplicative programs
Recommended article: Q5400050
Recommended article: Q3146104
Recommended article: Q5860790
Recommended article: Q3807003
Recommended article: Q4847826
Recommended article: Generalized linear multiplicative and fractional programming
Recommended article: Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
description: scientific article; zbMATH DE number 5539857