Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/14985
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBobade P.
dc.contributor.authorKumar P.
dc.contributor.authorChandrasekaran K.
dc.contributor.authorUsha D.
dc.date.accessioned2021-05-05T10:16:08Z-
dc.date.available2021-05-05T10:16:08Z-
dc.date.issued2020
dc.identifier.citation2020 IEEE International Conference on Computing, Power and Communication Technologies, GUCON 2020 , Vol. , , p. 639 - 643en_US
dc.identifier.urihttps://doi.org/10.1109/GUCON48875.2020.9231213
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/14985-
dc.description.abstractCholesterol, hypertension and diabetes are the three major chronic diseases from which most of the people suffers and these peoples often use search engines to acquire related information about these problems. But, almost every information related to diet on the internet isn't suitable for people to gather information about the diet suggestions. A system for diet suggestion which can advocate a prudent diet for such peoples is suggested in this paper. We designed a system that recommends a proper diet which has the adequate knowledge of three above mentioned highly chronic diseases. We propose a solution to the menu recommending problem using the optimization algorithm known as unbounded knapsack. We designed a model which satisfies the nutritional requirements of individuals while imposing the 'Laws of Nutrition', a set of hypothesis used by almost all Latin America's nutrition scientists. This prototype corresponds to a numerical optimization problem with constraints. We design a menu items generator application model to set up a convenient menu for a user with different properties. © 2020 IEEE.en_US
dc.titleOptimized diet plan using unbounded knapsack Algorithmen_US
dc.typeConference Paperen_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.