IDEAS home Printed from https://ideas.repec.org/a/igg/jaeis0/v12y2021i3p1-12.html
   My bibliography  Save this article

Research on Linear Programming Algorithm for Mathematical Model of Agricultural Machinery Allocation

Author

Listed:
  • Xiaoling Zhou

    (Basic Course Department, Guangzhou Railway Polytechnic, China)

  • Amit Sharma

    (Department of Computer Science and Engineering, Chitkara University, Chandigarh, India)

  • Vandana Mohindru

    (College of Engineering, Chandigarh Group of Colleges, India)

Abstract

The objective of this paper is to study the linear programming algorithm of the mathematical model of agricultural machinery allocation when there are many farmland projects and cross operations. In this paper, combined with the mechanization process of crops in XPCC, the linear programming algorithm of mathematical model was used to establish the allocation scheme of different scales. All equations were solved and analyzed, and the allocation schemes of different planting scales were compared. It is also observed that through the interactive conflicts in between multiple objectives a solution vector can be analyzed. The results show that the activity cost of Scheme 5 was the lowest, only 1,260 yuan per mu, which was the best way to equip agricultural machinery. The results present that it is of great significance to optimize the configuration of agricultural machinery. The experimental results present that the portion of water which is reused in comparison with the total water is gradually increasing which leads to the overall reduction in water consumption.

Suggested Citation

  • Xiaoling Zhou & Amit Sharma & Vandana Mohindru, 2021. "Research on Linear Programming Algorithm for Mathematical Model of Agricultural Machinery Allocation," International Journal of Agricultural and Environmental Information Systems (IJAEIS), IGI Global, vol. 12(3), pages 1-12, July.
    • Handle: RePEc:igg:jaeis0:v:12:y:2021:i:3:p:1-12
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJAEIS.2021070101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaeis0:v:12:y:2021:i:3:p:1-12. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.