关于一类投资方案的决策

A Decision on a Class of Invest Plan

现有资金若干，可用于投资一类项目，每个项目不能重复投资．已知各个项目的所需投资额和该项投资将会产生的利润，如何确定一个投资方案，使得利润总额最大？本文对此先给出一个求最佳投姿方案精确解的计算机算法，并编写出相应的ＦＯＲＴＲＡＮ语言程序，尔后介绍一种近似解法．

There is a amound of funds which may be invested to a class of projects each of them can not be repeated to invest.We know the investment amount of money for all projects and how many profits will be produced by every project.How do we decide a invest plan so as to get the most profitts? In this paper we the give a computer algorithm to obtain exact solution of optimum invest plan, and edit a corresponding FORTRAN Program. Then we introduce a approximate solution.