A new branch-and-bound algorithm for generalized affine multiplicative programming
From MaRDI portal
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A global optimization approach for solving the convex multiplicative programming problem
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- A method of acceleration for a class of multiplicative programming problems with exponent
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection
- A new global optimization approach for convex multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty
- An objective space cut and bound algorithm for convex multiplicative programmes
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Analysis of bounds for multilinear functions
- BARON: A general purpose global optimization software package
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties
- Effective algorithms for optimal portfolio deleveraging problem with cross impact
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- Enabling research through the SCIP Optimization Suite 8.0
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Global optimization of multiplicative programs
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- Linearization method for a class of multiplicative programming with exponent
- Multiplicative programming problems: Analysis and efficient point search heuristic
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problems
- Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs
- Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving Bicriterion Mathematical Programs
- Solving long-term financial planning problems via global optimization
- The bargaining problem
- Two-Person Cooperative Games
This page was built for publication: A new branch-and-bound algorithm for generalized affine multiplicative programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6921138)
