On the use of internal rate of return in linear and integer programming (Q1115802)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4087429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the use of internal rate of return in linear and integer programming |
scientific article; zbMATH DE number 4087429 |
Statements
On the use of internal rate of return in linear and integer programming (English)
0 references
1988
0 references
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.
0 references
internal rate of return
0 references
IRR constraints
0 references
branch and bound
0 references
0.7189602851867676
0 references
0.694693386554718
0 references
0.6918230652809143
0 references
