Diet Problem in Linear Programming

The goal of Diet problem is to minimize the cost of food satisfying nutrient constraints.

This code uses MATLAB inbuilt LP solver (linprog). There are 3 nutrients in the problem ( Carbohydrates , proteins and fat) which can be in between some minimum and maximum for a healthy diet. Objective here is to find cheapest diet satisfying nutrients requirement. There are five types of food with its cost. In this particular problem, Rice and Broccoli happens to be the cheapest diet. This file is for illustrating optimization in linear programming and not a suggestion for a healthy diet.