In this paper, we solve a diet problem of McDonald’s sets menu in order to find the optimal costs and satisfied the daily calories and nutritional requirements for a person. The nutrient contents and price for each set menu of McDonald’s need to be found. After that, by using the integer linear programming technique, we search the sets menu of McDonald’s with the minimum costs while satisfying the calories intake by a person is not exceeded 2500 Kcal / a day or 2200 Kcal / day. The mathematical model of the problem is formulated as linear integer programming where the total cost for the proposed set menu is the objective function. The constraints involved are the amounts of calories, carbohydrates, protein, fats, salt and sugar. By using the Solver tools in MS Excel, we solve this problem.