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 19 items.
- An accelerating algorithm for globally solving nonconvex quadratic programming (Q824677) (← links)
- An efficient algorithm for globally solving generalized linear multiplicative programming (Q899000) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- Generalized convex multiplicative programming via quasiconcave minimization (Q1359123) (← links)
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067) (← links)
- Global optimization for generalized linear multiplicative programming using convex relaxation (Q1721616) (← 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)
- (Q3146104) (← links)
- Global optimization algorithm for solving linear multiplicative programming problems (Q5085229) (← links)
- A new “Optimization‐Preserving‐Operator” applied to global optimization (Q5695217) (← links)
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs (Q6614694) (← links)
- A method based on parametric convex programming for solving convex multiplicative programming problem (Q6631563) (← links)
