Generating the Discrete Efficient Frontier to the Capital Budgeting Problem

DOI10.1287/OPRE.37.3.384MaRDI QIDQ3823367zbMATH OpenOpenAlexFDO

Authors Meir J. Rosenblatt, Zilla Sinuany-Stern

Publication date 1989

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.37.3.384

zbMATH Keywords

heuristic algorithmbranch-and-boundcapital budgetingtwo objective functionsDiscrete Efficient Frontier

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Boolean programming (90C09)

Recommendations

• Capital budgeting problems: a parameterized point of view
• Discrete dynamic programming and capital allocation
• Dependent-chance integer programming applied to capital budgeting
• scientific article; zbMATH DE number 428256
• scientific article; zbMATH DE number 4207168
• An effective matheuristic for the capacitated total quantity discount problem
• Improved rounding procedures for the discrete version of the capacitated EOQ problem
• A fast interactive solution method for large capital expenditure selection problems
• Optimal dynamic capital budgeting

Cited in

(18)

• Dynamic evolution of economically preferred facilities
• Inverse multi-objective combinatorial optimization
• scientific article; zbMATH DE number 1423920 (Why is no real title available?)
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• The variable sequencing approach: A solution to the capital budget allocation model
• A single facility location problem with a weighted maximin-minimax rectilinear distance
• Computing partitions with applications to capital budgeting problems
• A survey of recent developments in multiobjective optimization
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors.
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem
• Dynamic programming algorithms for the bi-objective integer knapsack problem
• Quadratic model for allocating operational budget in public and nonprofit organizations
• Investment decisions and sensitivity analysis: NPV-consistency of rates of return

This page was built for publication: Generating the Discrete Efficient Frontier to the Capital Budgeting Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3823367)