选择6个项目，同时最大化约束条件下的值 [英] Select 6 items while maximizing values under constraints

问题描述

我有许多项目的数据点，这些数据点具有与它们相关联的预定价格标签以及每个项目的自行计算的返回值.我希望从100多种商品中选择6项，以使总回报价值最大化，同时将6项商品的总价格保持在50,000美元以内.我已经使用求解器工具尝试了不同的解决方案，但无法获得所需的结果-但是我对求解器的了解不是很广.

I have numerous data points of items of which have a predetermined price-tag associated with them as well as a self calculated return value of each item. I'm looking to select 6 of the 100+ items in order to maximize the total return value while keeping the total price of the 6 items within a $50,000 constraint. I've tried different solutions using the solver tool but was unable to get the result I was looking for - however I am not very knowledgeable with solver.

推荐答案

因此，在发布图像时仅使用了一个小的数据集，而我没有花时间键入您放置在图像中的所有数据.

So, only used a small data set as you posted an image and I am not spending time typing all the data you put in the image.

看看这个:

因此，两个sumproducts和一个sum完成了求解器中的工作，二进制和两个约束.您可能想要查看"="或> ="对所选项目数的影响.

So, two sumproducts and a sum do the work, binary and two constraints in the solver. You might be wanting to check out the effects of "=" or ">=" for the number of items chosen.

这篇关于选择6个项目，同时最大化约束条件下的值的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！