A nonisolated optimal solution of general linear multiplicative programming problems
From MaRDI portal
Publication:1010262
DOI10.1016/J.COR.2008.11.002zbMATH Open1179.90262OpenAlexW2069847787MaRDI QIDQ1010262FDOQ1010262
Authors: Yongqiang Chen, Hong-Wei Jiao 
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.002
Recommendations
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A finite algorithm for a class of nonlinear multiplicative programs
- A global optimization for a class of multiplicative programming problems
- scientific article; zbMATH DE number 1799337
- A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
- scientific article; zbMATH DE number 4074828
- scientific article; zbMATH DE number 799617
- Generalized linear multiplicative and fractional programming
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization
global optimizationnonconvex optimizationbranch-and-boundnonisolated optimal solutiongeneral linear multiplicative programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Robust Optimization of Large-Scale Systems
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global optimization of multiplicative programs
- Heuristic methods for linear multiplicative programming
- A branch-and-reduce approach to global optimization
- \(NP\)-hardness of linear multiplicative programming and related problems
- A finite branch-and-bound algorithm for linear multiplicative programming
- A mean-absolute deviation-skewness portfolio optimization model
- Bilinear separation of two sets in \(n\)-space
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
- Solving long-term financial planning problems via global optimization
- Title not available (Why is that?)
- A global optimization approach for solving the convex multiplicative programming problem
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Title not available (Why is that?)
- Monotonic optimization: Problems and solution approaches
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Monotonic Optimization: Branch and Cut Methods
Cited In (17)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- An accelerating algorithm for globally solving nonconvex quadratic programming
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Global optimization algorithm for solving linear multiplicative programming problems
- An effective global optimization algorithm for quadratic programs with quadratic constraints
- Global optimization algorithm for a generalized linear multiplicative programming
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Solving globally the linear multiplicative programming problem via monotonic functions
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Range division and linearization algorithm for a class of linear ratios optimization problems
This page was built for publication: A nonisolated optimal solution of general linear multiplicative programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010262)
