Duality and Sensitivity Analysis for Fractional Programs
From MaRDI portal
Cited in
(22)- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Fractional programming
- A note on a dual scheme of a linear fractional programming problem
- Fractional programming
- Fractional 0-1 programming: applications and algorithms
- On an approach to the modelling of problems connected with conflicting economic interests
- Scheduling Players in Team Competitions: Theory and Computational Results
- Equivalence between a generalized Fenchel duality theorem and a saddle- point theorem for fractional programs
- Approximation algorithms for combinatorial fractional programming problems
- Bibliography in fractional programming
- Determining type II sensitivity ranges of the fractional assignment problem
- Fractional programming: Applications and algorithms
- Block coordinate Dinkelbach algorithms for solving block-structured constrained fractional optimization problems
- Allocation of resources according to a fractional objective
- Equivalence of various linearization algorithms for linear fractional programming
- Equivalence in linear fractional programming
- Experiments with linear fractional problems
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Approximating a class of combinatorial problems with rational objective function
- Parametric linear fractional programming for an unbounded feasible region
This page was built for publication: Duality and Sensitivity Analysis for Fractional Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4135251)
