ORiON Pub Date : 2014-01-01 DOI:10.5784/14-0-420
H. Kock, Stephan E. Visagie
{"title":"Wisselboustelsels in die Swartland","authors":"H. Kock, Stephan E. Visagie","doi":"10.5784/14-0-420","DOIUrl":null,"url":null,"abstract":"In the Swartland region farmers do not plant wheat exclusively. There are a lot of reasons for this. The main reason is that farmers who plant only one crop will end up with a situation where they will have to buy so much fertiliser that they would not be able to make any money. Every crop influences the crops on the same land later on. It is up to the farmer to decide what the influence will be. That means it is up to the farmer to decide what crop to plant on what land. The farmer ends up rotating a certain number of crops on his land. This rotation of crops is called a rotary crop system. In this situation arises the problem of what sequence of crops should be planted to ensure an optimal income to the farmer without exhausting the land. The problem could be solved by means of linear programming (LP). This problem, however, seem to get very large as the number of crops as well as the number of years over which the problem is solved is increased. By assuming that the influence of crops are only for three years and by restricting the number of years over which the problem is solved the problem is greatly reduced. If we look at the dual of the problem we find a further reduction. The solution of the dual problem also leads to the formulation of strategies. If we formulate the problem by means of the above mentioned strategies the problem reduces to a linear programming problem with only on constraint (which is the knapsack problem). The solution of this knapsack problem with help of a little game theory is then used in a computer program to assist farmers in deciding which crops to plant.","PeriodicalId":30587,"journal":{"name":"ORiON","volume":"18 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ORiON","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5784/14-0-420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在斯瓦特兰地区,农民并不只种植小麦。这有很多原因。主要原因是,只种植一种作物的农民最终将面临一种局面,即他们将不得不购买如此多的肥料,以至于他们无法赚钱。每一种作物以后都会影响同一块土地上的作物。影响是什么取决于农民。这意味着要由农民决定在什么土地上种植什么作物。农民最终在他的土地上轮种一定数量的作物。这种作物轮作被称为轮作作物系统。在这种情况下,就出现了应该种植什么样的作物序列以确保农民获得最佳收入而又不耗尽土地的问题。该问题可以用线性规划方法求解。然而,随着作物数量的增加以及解决这个问题的年数的增加,这个问题似乎变得非常严重。假定作物的影响只有三年,并限制解决问题的年数,问题就大大减少了。如果我们看一下问题的对偶,我们会发现进一步的简化。这一双重问题的解决也导致了战略的制定。如果我们用上述策略来表述问题,那么问题就变成了一个只有一个约束的线性规划问题(即背包问题)。在博弈论的帮助下,这个背包问题的解决方案被用在一个计算机程序中,以帮助农民决定种植哪种作物。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Wisselboustelsels in die Swartland
In the Swartland region farmers do not plant wheat exclusively. There are a lot of reasons for this. The main reason is that farmers who plant only one crop will end up with a situation where they will have to buy so much fertiliser that they would not be able to make any money. Every crop influences the crops on the same land later on. It is up to the farmer to decide what the influence will be. That means it is up to the farmer to decide what crop to plant on what land. The farmer ends up rotating a certain number of crops on his land. This rotation of crops is called a rotary crop system. In this situation arises the problem of what sequence of crops should be planted to ensure an optimal income to the farmer without exhausting the land. The problem could be solved by means of linear programming (LP). This problem, however, seem to get very large as the number of crops as well as the number of years over which the problem is solved is increased. By assuming that the influence of crops are only for three years and by restricting the number of years over which the problem is solved the problem is greatly reduced. If we look at the dual of the problem we find a further reduction. The solution of the dual problem also leads to the formulation of strategies. If we formulate the problem by means of the above mentioned strategies the problem reduces to a linear programming problem with only on constraint (which is the knapsack problem). The solution of this knapsack problem with help of a little game theory is then used in a computer program to assist farmers in deciding which crops to plant.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
11
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信