An Algorithm for solving the Integer Linear Fractional Programs
From MaRDI portal
Publication:4272560
DOI10.1080/02522667.1993.10699139zbMath0784.90087MaRDI QIDQ4272560
Publication date: 6 December 1993
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1993.10699139
90C10: Integer programming
90C32: Fractional programming
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Cites Work
- Unnamed Item
- Parametric Solution of Bicriterion Linear Fractional Programs
- An Algorithm for Finding All Vertices of Convex Polyhedral Sets
- Integer Programming Post-Optimal Analysis with Cutting Planes
- On the Polyhedrality of the Convex Hull of the Feasible Set of an Integer Program
- Programming with linear fractional functionals