Question $11$ to Question $13$ is based on this problem.

A dietitian wants to formulate a low$-$cost$,$ high$-$calorie food product for a customer. The following information is available about the $2$ ingredients that can be combined to make the food. The customer wants $1,000$ pounds of the food product, and it must contain at least $250$ pounds of food $1$ and $300$ pounds of food $2.$

Table $2-$ Chapter $7-1.$png

The multiple objective linear programming $($MOLP$)$ formulation for this problem is as follows:

Let X$1=$ Pounds of food $1,$

X$2=$ Pounds of food $2.$

MIN: $1\mathrm{.}24$ X$1+1$ X$2$ minimize cost of food product

MAX: $3,000$ X$1+2,500$ X$2$ maximize the calories

Subject to: $0\mathrm{.}15$ X$1+0\mathrm{.}25$ X fat

$0\mathrm{.}35$ X$1+0\mathrm{.}40$ X$2>=370$ protein

$0\mathrm{.}50$ X$1+0\mathrm{.}35$ X$2>=400$ carbohydrates

X$1>=250$ food $1$

X$2>=300$ food $2$

X$1+$ X$2=1,000$ total food product required

Xi $>=0$ for all i

Implement the MOLP formulation in spreadsheet and solve it by Solver.

What is the best possible value for the first objective $($i$.$e$.$ minimizing cost of food product$)$ in the problem? Rounding the decimals of your answer to units.

Group of answer choices

$$1310$

$$1460$

$$960$

$$1080$

$$1220$

A value different from all the above