这是什么样的线性规划?

发布于 2025-01-19 17:20:48 字数 807 浏览 0 评论 0原文

我最近开始学习运筹学(OR),我遇到了一个问题,我很难将其建模为传统的运筹学问题。我不确定这样的问题是否是线性问题,也不确定是否可以使用 LP 方法来解决。

问题描述 我需要找到购买一批产品的最低购买金额(T),遵守每个产品必须至少购买总购买金额的 ax% 的限制。

描述产品和限制的表格

数据玉米(x1)大豆(x2) 小麦(x3) 大米(x4)
最小袋子重量(公斤)100100100100
统一价格 袋子(美元)4,0003,2004,5001,600
百分含量每种产品(占 T 的百分比)32%27%15%26%

条件 每个产品的袋数(x1,x2,x3,x4)必须为整数,即不允许有小数袋。

目标是通过观察每种产品占总购买价值的百分比来确定购买所有产品的最低购买金额。

如果您找到解决方案,请描述将使用哪种技术/方法,并明确这是什么类型的 OR 问题?

谢谢。

I started study Operations Research (OR) recently and I faced a problem which I struggled to modeling it to traditional OR problems. I'm not sure if such problem is a linear one nor if it can be solved using LP methods.

Problem Description
I need to find the minimum purchase amount (T) to buy a batch of products, observing a restriction that each product must be purchased at least a x% of total purchase amount .

Table describing products and restrictions

DataCorn(x1)Soy(x2)Wheat(x3)Rice (x4)
Minimum Bag Weight (kg)100100100100
Unitary Price Bag ($)4,0003,2004,5001,600
Perc(% of T) of each Product32%27%15%26%

Conditions
The amount of bags of each product (x1,x2,x3,x4) must be integer, i.e., no fractional bag is allowed.

The objective is to determine the minimum purchase amount to buy all of the products observing the percentage of total purchase value for each one.

If you find a solution for this, please describe which technique/method will be used and make clear what kind of OR problem is this ?

Thanks.

如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

扫码二维码加入Web技术交流群

发布评论

需要 登录 才能够评论, 你可以免费 注册 一个本站的账号。

评论(1

谁把谁当真 2025-01-26 17:20:48

这是一个线性编程问题,但是这个问题似乎有问题。目前,您无法真正购买,例如“至少27%的玉米”。每种产品的百分比为100%。因此,在这种情况下,它们都必须处于确切的百分比或增加的百分比,这将减少另一个是不可行的。严格百分比的数学模型将是:

Minimize T = 4000x1 +3200x2 +4500x3 +1600x4

4000x1 = T*(32/100)

3200x2 = T*(27/100)

4500x3 = T*(15/100)

1600x4 = T*(26/100)

x1,x2,x3,x4 >= 100

x1,x2,x3,x4 = integer

It is a linear programming problem, but it looks like there is something wrong about the question. You can't really buy, let's say 'at least 27% corn', at the moment. Percentages of each product are given with a total of 100%. So in this case they all have to be in that exact percentage or increasing one will decrease the other which is infeasible. Mathematical model for strict percentages would be:

Minimize T = 4000x1 +3200x2 +4500x3 +1600x4

4000x1 = T*(32/100)

3200x2 = T*(27/100)

4500x3 = T*(15/100)

1600x4 = T*(26/100)

x1,x2,x3,x4 >= 100

x1,x2,x3,x4 = integer
~没有更多了~
我们使用 Cookies 和其他技术来定制您的体验包括您的登录状态等。通过阅读我们的 隐私政策 了解更多相关信息。 单击 接受 或继续使用网站,即表示您同意使用 Cookies 和您的相关数据。
原文