Pre-Emptive and Non-Pre-Emptive Goal Programming Problems for Optimal Menu Planning in Diet Management of Indian Diabetes Mellitus Patients

Int J Environ Res Public Health. 2021 Jul 24;18(15):7842. doi: 10.3390/ijerph18157842.


Diet management or caloric restriction for diabetes mellitus patients is essential in order to reduce the disease's burden. Mathematical programming problems can help in this regard; they have a central role in optimal diet management and in the nutritional balance of food recipes. The present study employed linear optimization models such as linear, pre-emptive, and non-pre-emptive goal programming problems (LPP, PGP and NPGP) to minimize the deviations of over and under achievements of specific nutrients for optimal selection of food menus with various energy (calories) levels. Sixty-two food recipes are considered, all selected because of being commonly available for the Indian population and developed dietary intake for meal planning through optimization models. The results suggest that a variety of Indian food recipes with low glycemic values can be chosen to assist the varying glucose levels (>200 mg/dL) of Indian diabetes patients.

Keywords: Indian food recipes; diabetes mellitus; diet management; goal programming problems (GP); linear programming problem (LPP).

MeSH terms

  • Diabetes Mellitus* / prevention & control
  • Diet
  • Energy Intake
  • Goals
  • Humans
  • Menu Planning*