Contact
Algeria - National academic platform
...
Prepare your scientific stay

Host laboratory · Invitation letter · Application guidance

Learn more

AI & Research · arXiv AI · publications

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

Source excerpt

This page presents AI and research content to help researchers, students and AI tools read, cite and verify the information.

arXiv:2605.13849v1 Announce Type: new 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.

Your DzCademia workshop

Check a publication method or promise

A video or journal-finding tool can shortlist titles, not guarantee acceptance. Check identity, scope, author instructions and possible fees at official sources. Do not choose solely on speed promises or one indicator.

A practical exercise

Compare two journals against your research question: fit, article types, instructions and verified terms. Keep unknowns as questions rather than assumptions.

Record reference points
Topic
Mixed Integer Goal Programming for Personalized Meal Optimization with User-Defined Serving Granularity
Source website
arxiv.org
Publication date at source
2026-05-16
Collection date on DzCademia
2026-05-16
My preparation plan

An indicative personal list, separate from official documents or requirements. Checkmarks stay on this device; no account needed.

0 / 5 steps checked

Read the source

DzCademia advice and exercises are separate from the source summary and requirements. This structured aid uses automated assistance and is neither scientific validation nor a selection promise. Source consulted on 2026-10-28.

View the original source

Official or original source: arXiv AI. Always check the details against the primary source.

Back to AI & Research
369
Listed events
1419485
Total visits
2191
Visits today