Generalized Weighted Mean Programming
From MaRDI portal
Cited in
(19)- An alternative linearization technique
- A condensation method for generalized geometric programming
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems
- On generalized geometric programming problems with non-positive variables
- Global optimization of signomial geometric programming using linear relaxation.
- Global optimization of generalized geometric programming
- Comparison of generalized geometric programming algorithms
- A global optimization algorithm for signomial geometric programming problem
- Linearization method of global optimization for generalized geometric programming
- Inner approximation algorithm for generalized linear multiplicative programming problems
- A global optimization using linear relaxation for generalized geometric programming
- A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
- An efficient convexification method for solving generalized geometric problems
- Investigation of path-following algorithms for signomial geometric programming problems
- Branch-reduction-bound algorithm for generalized geometric programming
- Condensing generalized polynomials
- Condensing generalized polynomials
- A deterministic global optimization algorithm for generalized geometric programming
This page was built for publication: Generalized Weighted Mean Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5642454)