An Algorithm for solving the Integer Linear Fractional Programs

DOI10.1080/02522667.1993.10699139zbMath0784.90087OpenAlexW2049818425MaRDI QIDQ4272560

Omar M. Saad

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

zbMATH Keywords

simplex methodinteger linear fractional programs

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

Solution of some convex separable resource allocation and production planning problems with bounds on the variables

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

This page was built for publication: An Algorithm for solving the Integer Linear Fractional Programs