A robust algorithm for generalized geometric programming
From MaRDI portal
Publication:934812
DOI10.1007/S10898-008-9283-0zbMATH Open1152.90613OpenAlexW1986495770MaRDI QIDQ934812FDOQ934812
Authors: Yuan Ma, Peiping Shen, Yongqiang Chen 
Publication date: 30 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9283-0
Recommendations
- Global optimization of generalized geometric programming
- An approximate algorithm for global solution of generalized geometric programming
- A global optimization using linear relaxation for generalized geometric programming
- Algorithm of global optimization for generalized geometric programming
- A new global optimization algorithm for solving generalized geometric programming
Global optimizationGeneralized geometric programmingEssential optimal solutionMonotonic optimizationRobust solution
Cites Work
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Restricted multinomial maximum likelihood estimation based upon Fenchel duality
- Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach
- Global optimization of signomial geometric programming using linear relaxation.
- Global optimization of generalized geometric programming
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Allocation of resources in project management
- A new rectangle branch-and-pruning approach for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- A stochastic geometric programming problem with multiplicative recourse
- A deterministic global optimization algorithm for generalized geometric programming
- Robust solution of nonconvex global optimization problems
- Monotonic optimization: Problems and solution approaches
- Title not available (Why is that?)
- Monotonic Optimization: Branch and Cut Methods
Cited In (18)
- Signomial and polynomial optimization via relative entropy and partial dualization
- Global optimization for generalized geometric programming problems with discrete variables
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Copula theory approach to stochastic geometric programming
- An approximate algorithm for global solution of generalized geometric programming
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- Recent advances in robust optimization: an overview
- Two problems with GGP generalized geometric programming algorithm
- Title not available (Why is that?)
- A global optimization algorithm for signomial geometric programming problem
- A geometric branch and bound method for robust maximization of convex functions
- Global optimization for the generalized polynomial sum of ratios problem
- Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras
- Title not available (Why is that?)
- Branch-reduction-bound algorithm for generalized geometric programming
- Tractable approximate robust geometric programming
- Global minimization for generalized polynomial fractional program
This page was built for publication: A robust algorithm for generalized geometric programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q934812)
