Pages that link to "Item:Q972168"
From MaRDI portal
The following pages link to A new global optimization approach for convex multiplicative programming (Q972168):
Displaying 8 items.
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
