Generating the Discrete Efficient Frontier to the Capital Budgeting Problem

DOI10.1287/opre.37.3.384zbMath0669.90009OpenAlexW2024344169MaRDI QIDQ3823367

Zilla Sinuany-Stern, Meir J. Rosenblatt

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

branch-and-boundheuristic algorithmcapital budgetingtwo objective functionsDiscrete Efficient Frontier

Mathematics Subject Classification ID

Related Items (15)

A single facility location problem with a weighted maximin-minimax rectilinear distance ⋮ Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Unnamed Item ⋮ A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem ⋮ Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems ⋮ Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ Inverse multi-objective combinatorial optimization ⋮ Quadratic model for allocating operational budget in public and nonprofit organizations ⋮ 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 ⋮ A survey of recent developments in multiobjective optimization ⋮ Investment decisions and sensitivity analysis: NPV-consistency of rates of return ⋮ Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

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