A hybrid relaxation method for solving generalized linear fractional programs
From MaRDI portal
Cites work
- A branch and bound algorithm for solving mean-risk-skewness portfolio models
- A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A deterministic global optimization algorithm for generalized geometric programming
- A new accelerating method for globally solving a class of nonconvex programming problems
- A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
- A solution approach for log truck scheduling based on composite pricing and branch and bound
- A unified monotonic approach to generalized linear fractional programming
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
- An outcome-space finite algorithm for solving linear multiplicative programming
- An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems
- Global optimality bounds for the placement of control valves in water supply networks
- Global optimization for sum of generalized fractional functions
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Image space branch-reduction-bound algorithm for globally minimizing a class of multiplicative problems
- Level set algorithm for solving convex multiplicative programming problems
- Optimising portfolio diversification and dimensionality
- 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 outer approximation branch-and-bound algorithm for a class of linear multiplicative programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
- Range division and linearization algorithm for a class of linear ratios optimization problems
- Solving long-term financial planning problems via global optimization
- Solving Quadratic Programming by Cutting Planes
- Solving the sum-of-ratios problem by an interior-point method
- Solving the sum-of-ratios problems by a harmony search algorithm
- Two-level linear relaxation method for generalized linear fractional programming
This page was built for publication: A hybrid relaxation method for solving generalized linear fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857027)
