Reverse polyblock approximation for generalized multiplicative/fractional programming
From MaRDI portal
Recommendations
- A unified monotonic approach to generalized linear fractional programming
- Global optimization for sum of generalized fractional functions
- A full polynomial time approximation algorithm for generalized linear multiplicative problems
- A global optimization approach for solving generalized nonlinear multiplicative programming problem
- A fully polynomial time approximation algorithm for generalized linear multiplicative programming
Cited in
(9)- An out space accelerating algorithm for generalized affine multiplicative programs problem
- Optimizing over Pareto set of semistrictly quasiconcave vector maximization and application to stochastic portfolio selection
- Global optimization algorithm for a generalized linear multiplicative programming
- Global optimization algorithm for solving linear multiplicative programming problems
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
- A criterion space algorithm for solving linear multiplicative programming problems
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
This page was built for publication: Reverse polyblock approximation for generalized multiplicative/fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1762797)
