Pages that link to "Item:Q2358874"
From MaRDI portal
The following pages link to An efficient convexification method for solving generalized geometric problems (Q2358874):
Displaying 5 items.
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Indicator of power convex and exponential transformations for solving nonlinear problems containing posynomial terms (Q2164609) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- Efficient Convexification Strategy for Generalized Geometric Programming Problems (Q5138255) (← links)
