On the use of internal rate of return in linear and integer programming (Q1115802)

This paper is meant to demonstrate the use of IRR (internal rate of return) concepts in mathematical programming problems. It is shown how IRR constraints can be used in linear and integer programming models. An algorithm is presented which constructs a solution to a general 0-1 programming problem (P), in which IRR is to be minimized, within a tolerance of a given \(\epsilon\). A linearization of (P) is then used within a general branch and bound algorithm to solve such problems to optimality.