Quadratic Binary Programming with Application to Capital-Budgeting Problems

Journal Article

The purpose of this paper is to present an algorithm for solving the quadratic binary programming problem. Although a problem with this structure may arise in many situations, it is particularly common in capital budgeting when a decision-maker is confronted with a set of investment proposals from which he must select a portfolio. If returns of proposals are intercorrelated random variables and if the decision-maker uses as his criterion for selection the mean μ and variance σ2 of portfolio returns, his decision requires prior identification of the (μ, σ2) efficient set. The algorithm developed to solve the problem and hence necessary to generate the efficient set is based on the concept of implicit enumeration recently introduced by Egon Balas for solution of the binary linear programming problem.

Full Text

Duke Authors

Cited Authors

  • Laughhunn, DJ

Published Date

  • June 1, 1970

Published In

Volume / Issue

  • 18 / 3

Start / End Page

  • 454 - 461

Published By

Electronic International Standard Serial Number (EISSN)

  • 1526-5463

International Standard Serial Number (ISSN)

  • 0030-364X

Digital Object Identifier (DOI)

  • 10.1287/opre.18.3.454


  • en