A Mathematical Model of Diet Menu Problem Based on Boolean Linear Programming Approach

Authors

  • Latifah Hanum Harahap Postgraduated Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sumatera Utara
  • Mahyuddin K. M. Nasution Faculty of Information Science & Technology, Universitas Sumatera Utara, Medan
  • Sawaluddin Department of Mathematics, Faculty of Mathematics and Sciences, Universitas Sumatera Utara, Medan

DOI:

10.33395/sinkron.v8i3.12592

Keywords:

Mathematical model, Diet menu problem, Linear programming approach

Abstract

This study aims to model the diet menu problem based on a Boolean Linear Programming approach. A balanced diet is the key to a healthy lifestyle. A balanced diet is a diet that combines foodstuffs in the right amount of food components in one menu (dishes using certain recipes). When you have an unbalanced diet, your body will not get the right amount of nutrients. This is what causes the importance of managing the diet menu. Because of that, a diet menu problem model was formed based on the Boolean Linear Programming approach to cover a varied range of daily diet menu management and meet daily nutritional needs while minimizing costs. The stages of establishing the diet menu problem model are carried out by determining the notations, parameters, variables, objective functions, and some constraints related to the diet menu.

 

GS Cited Analysis

Downloads

Download data is not yet available.

Author Biographies

Mahyuddin K. M. Nasution, Faculty of Information Science & Technology, Universitas Sumatera Utara, Medan

 

 

Sawaluddin, Department of Mathematics, Faculty of Mathematics and Sciences, Universitas Sumatera Utara, Medan

 

 

References

Akutsu, T. (2018). Algorithms for analysis, inference, and control of Boolean networks. World Scientific.

Cobham, A., Fridshal, R., & North, J. H. (1961). An application of linear programming to the minimization of Boolean functions. 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961), 3–9.

Eghbali, H., Eghbali, M. A., & Kamyad, A. V. (2012). Optimizing human diet problem based on price and taste using multi-objective fuzzy linear programming approach. An International Journal of Optimization and Control: Theories & Applications (IJOCTA), 2(2), 139–151.

Gautam, L. K., & Gulhane, V. S. (2023). Diet Recommendation Model Using Multi Constraint Metaheuristic and Knapsack Optimization Algorithm. International Journal of Next-Generation Computing, 14(1).

Gumustekin, S., Senel, T., & Cengiz, M. A. (2014). A comparative study on Bayesian optimization algorithm for nutrition problem. Journal of Food and Nutrition Research, 2(12), 952–958.

Hsiao, J.-H., & Chang, H. (2010). SmartDiet: A personal diet consultant for healthy meal planning. 2010 IEEE 23rd International Symposium on Computer-Based Medical Systems (CBMS), 421–425.

Hui, L. S., & Sufahani, S. (2019). Healthy menu scheduling for high blood pressure patient with optimization method through integer programming. Advances in Computing and Intelligent System, 1(1).

Kaldirim, E., & Kose, Z. (2006). Application of a multi-objective genetic algorithm to the modified diet problem. Genetic and Evolutionary Computation Conference (GECCO), 6.

Khan, M. A., Haq, A., & Ahmed, A. (2021). Multi-objective model for daily diet planning. Reliability: Theory & Applications, 16(1 (61)), 89–97.

Mezentsev, Y. A. (2016). Binary Cut-and-Branch Method for Solving Linear Programming Problems with Boolean Variables. DOOR (Supplement), 72–85.

Nasution, M. K. M. (2020). Multi-criteria as decisions. IOP Conference Series: Materials Science and Engineering, 1003(1), 12118.

Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial optimization: algorithms and complexity. Courier Corporation.

Pardalos, P. M., Du, D.-Z., & Graham, R. L. (2013). Handbook of combinatorial optimization. Springer.

Pichugina, O. (2020). Diet-menu problem modelling and applications. 2020 IEEE 2nd International Conference on System Analysis & Intelligent Computing (SAIC), 1–5.

Pichugina, O., & Yakovlev, S. (2020). Euclidean combinatorial configurations: continuous representations and convex extensions. Lecture Notes in Computational Intelligence and Decision Making: Proceedings of the XV International Scientific Conference “Intellectual Systems of Decision Making and Problems of Computational Intelligence”(ISDMCI’2019), Ukraine, May 21–25, 2019 15, 65–80.

Pichugina, O., & Yakovlev, S. (2019). Euclidean combinatorial configurations: Typology and applications. 2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON), 1065–1070.

Sabino, F. B., Federal, U., & Grande, R. (2015). Linear and Integer Programming: With Excel Examples. May.

Sierksma, G. (2001). Linear and integer programming: theory and practice. CRC Press.

Stigler, G. J. (1945). The cost of subsistence. Journal of Farm Economics, 27(2), 303–314.

Downloads


Crossmark Updates

How to Cite

Harahap, L. H., Nasution, M. K. M. ., & Sawaluddin, S. (2023). A Mathematical Model of Diet Menu Problem Based on Boolean Linear Programming Approach . Sinkron : Jurnal Dan Penelitian Teknik Informatika, 7(3), 1453-1460. https://doi.org/10.33395/sinkron.v8i3.12592