Key points are not available for this paper at this time.
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.
Dan J. Laughhunn (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: