Please use this identifier to cite or link to this item:
http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/29371
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jacob, Rebecca | - |
dc.contributor.author | Nyor, Ngutor | - |
dc.contributor.author | Audu, Khadeejah James | - |
dc.date.accessioned | 2025-05-08T17:23:58Z | - |
dc.date.available | 2025-05-08T17:23:58Z | - |
dc.date.issued | 2024-09-22 | - |
dc.identifier.citation | Jacob Rebecca, Nyor Ngutor & Khadeejah James Audu. (2024). Linear Programming for Profit Maximization of Agricultural Stock. Proceedings of International Conference on Mathematical Modelling Optimization and Analysis of Disease Dynamics (ICMMOADD). | en_US |
dc.identifier.uri | http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/29371 | - |
dc.description | A Conference Proceeding | en_US |
dc.description.abstract | This paper addresses some predominant problems peculiar to investment in agriculture such as the problem of determining which stocks is to be invested in order to maximize profit. Ten (10) agricultural stocks were considered using Linear programming model and simplex method was used as the numerical tool for the computation of the optimal solution. The optimal solution was verified using TORA software the results obtained showed that not all items should be invested in order to maximize profit. | en_US |
dc.description.sponsorship | Self-Funding | en_US |
dc.publisher | Maths Model Research Group, FUT, Minna, Nigeria | en_US |
dc.subject | agricultural stock, linear programming (LP), mathematical programming, profit maximization, | en_US |
dc.subject | sensitivity analysis, simplex method | en_US |
dc.title | LINEAR PROGRAMMING FOR PROFIT MAXIMIZATION OF AGRICULTURAL STOCK | en_US |
dc.type | Article | en_US |
Appears in Collections: | Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
KJA 3 ICMMOADD 2024.pdf | A Conference Proceeding | 2.44 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.