Image space analysis of generalized fractional programs
From MaRDI portal
Publication:1315441
DOI10.1007/BF01096535zbMath0809.90121OpenAlexW2050513930MaRDI QIDQ1315441
James E. Falk, Susan W. Palocsay
Publication date: 10 March 1994
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01096535
Related Items (52)
A fifth bibliography of fractional programming* ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ Unnamed Item ⋮ A global optimization algorithm for linear fractional programming ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ A FPTAS for a class of linear multiplicative problems ⋮ An outcome-space finite algorithm for solving linear multiplicative programming ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ Outcome space range reduction method for global optimization of sum of affine ratios problem ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique ⋮ Lagrange duality and partitioning techniques in nonconvex global optimization ⋮ Generating sum-of-ratios test problems in global optimization ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem ⋮ An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem ⋮ Constrained integer fractional programming problem with box constraints ⋮ An efficient algorithm and complexity result for solving the sum of general affine ratios problem ⋮ A new linearization method for generalized linear multiplicative programming ⋮ An accelerating outer space algorithm for globally solving generalized linear multiplicative problems ⋮ A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ A potential practical algorithm for minimizing the sum of affine fractional functions ⋮ An efficient algorithm for globally solving generalized linear multiplicative programming ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ Unnamed Item ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ Solving sum of ratios fractional programs via concave minimization ⋮ Solving sum-of-ratios fractional programs using efficient points ⋮ An iterative approach to solve multiobjective linear fractional programming problems ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ Maximizing a linear fractional function on a Pareto efficient frontier ⋮ On the global optimization of sums of linear fractional functions over a convex set ⋮ Global optimization for sum of linear ratios problem with coefficients ⋮ Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs ⋮ Global optimization of nonlinear sums of ratios ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ An effective algorithm for globally solving sum of linear ratios problems ⋮ Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions ⋮ Resource allocation: a common set of weights model ⋮ Global Optimization of Linear Multiplicative Programming Using Univariate Search ⋮ Outcome-space cutting-plane algorithm for linear multiplicative programming ⋮ Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations ⋮ A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems ⋮ Global optimization method for linear multiplicative programming ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Cites Work
- Unnamed Item
- Unnamed Item
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Linear multiplicative programming
- A parametric method for solving certain nonconcave maximization problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- On Maximizing a Sum of Ratios
- Bounds on a Trauma Outcome Function via Optimization
- A note on the sum of a linear and linear-fractional function
- Programming with linear fractional functionals
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- On Nonlinear Fractional Programming
- A Class of Fractional Programming Problems
This page was built for publication: Image space analysis of generalized fractional programs
