Pages that link to "Item:Q296971"
From MaRDI portal
The following pages link to Global optimization of signomial geometric programming problems (Q296971):
Displayed 9 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Signomial and polynomial optimization via relative entropy and partial dualization (Q823883) (← links)
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
- Inner approximation algorithm for generalized linear multiplicative programming problems (Q2061502) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Strong stability of optimal design to dynamic system for the fed-batch culture (Q2962390) (← links)
- Solving a posynomial geometric programming problem with fully fuzzy approach (Q3388431) (← links)
- A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network (Q6065614) (← links)