On the use of internal rate of return in linear and integer programming
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3709922 (Why is no real title available?)
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
- Optimal TIC Bids on Serial Bond Issues
- Optimization of the Arbitrage Process in Advance Refunding of Municipal Bonds
- True Interest Cost in Municipal Bond Bidding: An Integer Programming Approach
Cited in
(6)- Stochastic internal rate of return on investments in sustainable assets generating carbon credits
- Investment decisions and sensitivity analysis: NPV-consistency of rates of return
- scientific article; zbMATH DE number 5802257 (Why is no real title available?)
- A Fourth bibliography of fractional programming
- scientific article; zbMATH DE number 1996457 (Why is no real title available?)
- Bridging the Gap Between Roe and IRR
This page was built for publication: On the use of internal rate of return in linear and integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115802)