Mixed Integer Goal Programming for Personalized Meal Optimization with User-Defined Serving Granularity

TL;DR

This paper introduces MIGP, a novel mixed integer goal programming approach for personalized meal planning that ensures practical servings, balances multiple nutrients, and outperforms traditional methods in solution quality and feasibility.

Contribution

It combines integer programming with goal programming to address fractional servings and infeasibility issues in diet optimization, providing an open-source implementation.

Findings

MIGP matches continuous optimal solutions with integer servings in large meal instances.

In 66% of tested cases, MIGP outperforms GP with post-hoc rounding, never being worse.

Solve times are under 100 ms for typical meal sizes using HiGHS solver.

Abstract

Determining what to eat to satisfy nutritional requirements is one of the oldest optimization problems in operations research, yet existing formulations have two persistent limitations: continuous variables produce impractical fractional servings (1.7 eggs, 0.37 bananas), and hard nutrient constraints cause infeasibility when targets conflict. A systematic review of 56 diet optimization papers found that none combine integer programming with goal programming to address both issues. We propose Mixed Integer Goal Programming (MIGP) for personalized meal optimization. The formulation uses integer variables for practical serving counts and goal programming deviations for soft nutrient targets, with inverse-target normalization to balance multi-nutrient optimization. Per-food serving granularity allows natural units (one egg, one tablespoon of oil) without post-hoc rounding. We characterize the integrality gap in the goal programming context and identify a deviation absorption property: GP deviation variables buffer the cost of requiring integer servings, making the gap structurally smaller than in hard-constraint MIP. For meals with 15+ foods, the integer solution matches the continuous optimum in every benchmark instance. A computational evaluation across 810 instances (30 USDA foods, 9 configurations, 3 methods) shows MIGP finds strictly better solutions than GP with post-hoc rounding in 66% of cases (never worse) while maintaining 100% feasibility; hard-constraint IP achieves only 48%. Solve times stay under 100 ms for typical meal sizes using the open-source HiGHS solver. The implementation is available as an open-source Python module integrated into an interactive meal planning application.