Please use this identifier to cite or link to this item:
http://repository.futminna.edu.ng:8080/jspui/handle/123456789/28794
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Abdurrahman, Nurat Olamide | - |
dc.contributor.author | Ibrahim, Mohammed | - |
dc.date.accessioned | 2024-05-24T10:33:57Z | - |
dc.date.available | 2024-05-24T10:33:57Z | - |
dc.date.issued | 2023-07 | - |
dc.identifier.issn | (Print): 2682 - 5694 ; (Online): 2682 - 5708 | - |
dc.identifier.uri | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/28794 | - |
dc.description.abstract | Solid waste is anything from domestic, commercial, or industrial sources that is no longer needed. It is deposited as undesired. Waste disposal did not become an issue when there were few habitations and a lot of open space. Waste disposal becomes a real concern in towns and cities when more individuals move there in pursuit of employment. [6,12] Using a set of ordinary differential equations, a mathematical model for managing solid waste is put forth in this study. The solution's existence and uniqueness are proven. In order to simulate the sensitive parameter for solid waste management, the next-generation matrix is used to identify the basic reproduction number R0. It has been found that when waste production increases, so does the rate at which energy is produced from waste. Keywords: biodegradable, incineration, reproductive number, waste, next-generation matrix, decomposition. | en_US |
dc.language.iso | en | en_US |
dc.subject | reproductive number; | en_US |
dc.subject | Solid Waste Management | en_US |
dc.subject | biodegradable; | en_US |
dc.subject | next generation matrix; . | en_US |
dc.title | Mathematical modelling of solid waste management. | en_US |
dc.type | Article | en_US |
Appears in Collections: | Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IJMAM Merged.pdf | 1.97 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.