Constrained integer linear fractional programming problem

Abstract

An integer linear fractional programming problem, whose integer solution is required to satisfy any h out of given n sets of constraints has been discussed in this paper. Method for ranking and scanning all integer points has also been developed and a numerical illustration is included in support of theory.

Keywords:

• Fractional Programming
• Integer Programming

AMS 1980 Subject Classifications:

• Primary: 90 C 32
• Secondary: 90 C 10