Equivalence in linear fractional programming

DOI10.1080/02331939208843743zbMath0819.90109OpenAlexW2017635088MaRDI QIDQ4327875

Laura Martein, Alberto Cambini

Publication date: 27 March 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843743

zbMATH Keywords

linear fractional problem

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items (11)

The optimal level solution method applied to a non linear programming problem with exponential objective function ⋮ Optimizing a linear fractional function over the integer efficient set ⋮ Generating the efficient set of multiobjective integer linear plus linear fractional programming problems ⋮ Parametric linear fractional programming for an unbounded feasible region ⋮ A computational comparison between algorithms for linear fractional programming ⋮ Solving discrete linear fractional bilevel programs with multiple objectives at the upper level ⋮ The optimal level solutions method ⋮ An exact method for a discrete multiobjective linear fractional optimization ⋮ An improved method for solving multiobjective integer linear fractional programming problem ⋮ Composition theorems for generalized concave vector valued functions ⋮ An Exact Method for a Discrete Quadratic Fractional Maximum Problem

Cites Work

• Experiments with linear fractional problems
• Parameter-free convex equivalent and dual programs of fractional programming problems
• Duality and Sensitivity Analysis for Fractional Programs
• Programming with linear fractional functionals
• Hyperbolic programming
• Algorithmic Equivalence in Linear Fractional Programming

This page was built for publication: Equivalence in linear fractional programming