Spatial algorithm for mixed integer generalized affine multiplicative problems
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 7668283 (Why is no real title available?)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A deterministic global optimization algorithm for generalized geometric programming
- A finite branch-and-bound algorithm for linear multiplicative programming
- A hybrid LP/NLP paradigm for global optimization relaxations
- A new branch-and-bound algorithm for generalized affine multiplicative programming
- A new linearization method for generalized linear multiplicative programming
- A new two-level linear relaxed bound method for geometric programming problems
- A nonisolated optimal solution of general linear multiplicative programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A practicable branch and bound algorithm for sum of linear ratios problem
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- A unified monotonic approach to generalized linear fractional programming
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An objective space cut and bound algorithm for convex multiplicative programmes
- An outcome space algorithm for solving general linear multiplicative programming
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- An outcome-space finite algorithm for solving linear multiplicative programming
- Approximation of linear fractional-multiplicative problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Bibliography: Ninth bibliography of fractional programming
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints
- Finite algorithm for generalized linear multiplicative programming
- Fractional programming
- Geometric Programming: Methods, Computations and Applications
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- Global minimization of a generalized linear multiplicative programming
- Global optimization for sum of generalized fractional functions
- Global optimization of multiplicative programs
- Global optimization of signomial geometric programming using linear relaxation.
- Heuristic methods for linear multiplicative programming
- Image space analysis of generalized fractional programs
- Linear-fractional programming. Theory, methods, applications and software.
- Linearization method of global optimization for generalized geometric programming
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
- 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
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving long-term financial planning problems via global optimization
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- Two-level linear relaxation method for generalized linear fractional programming
This page was built for publication: Spatial algorithm for mixed integer generalized affine multiplicative problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834800)
