1. ## linear programming

hello everyone...

I have a quation here says
Bulldust Inc. blends silicon and nitrogen to produce two types of fertiliser. Fertiliser 1
must be at least 40% nitrogen and sells for $20/kg. Fertiliser 2 must be at least 70% silicon and sells for$18/kg. Bulldust can purchase up to 800 kg of nitrogen at $10/kg and up to 1000 kg of silicon at$8/kg. Assuming that all fertiliser produced can be sold,
formulate an LP to help Bulldust maximize profit.

Ive tried so many different ways but still cant get the right answer.. could please someone help me answering this question

thanks.

2. Originally Posted by maths4ever
hello everyone...

I have a quation here says
Bulldust Inc. blends silicon and nitrogen to produce two types of fertiliser. Fertiliser 1
must be at least 40% nitrogen and sells for $20/kg. Fertiliser 2 must be at least 70% silicon and sells for$18/kg. Bulldust can purchase up to 800 kg of nitrogen at $10/kg and up to 1000 kg of silicon at$8/kg. Assuming that all fertiliser produced can be sold,
formulate an LP to help Bulldust maximize profit.

Ive tried so many different ways but still cant get the right answer.. could please someone help me answering this question

thanks.
Let $\displaystyle x_1$ and $\displaystyle x_2$ be the number of kg's of fertilizer 1 and 2 produced respectivley.

Let $\displaystyle y_1$ and $\displaystyle y_2$ be the proportion of N in f1 and f2 respectivly,

Then the cost is:

$\displaystyle c=x_1[10y_1+8(1-y_1)]+x_2[10y_2+8(1-y_2)]$

and the revenue is:

$\displaystyle r=20x_1+18x_2$

so the profit is:

$\displaystyle p=x_1[20-2y_1-8]+x_2[18-2y_2-8]=x_1[12-2y_1]+x_1[12-2y_2]$

This last is the objective (note its not linear unless $\displaystyle y_1$ and $\displaystyle y_2$ are fixed).

We have constaints:

$\displaystyle y_1 \ge 0.4$

$\displaystyle 0 \le y_2 \le 0.3$

$\displaystyle y_1x_1+y_2x_2 \le 800$

$\displaystyle (1-y_1)x_1+(1-y_2)x_2 \le 1000$

$\displaystyle x_1 \ge 0$

$\displaystyle x_2 \ge 0$

Again note this is not a linear programming problem unless the $\displaystyle y$'s are fixed.

RonL

3. Originally Posted by maths4ever
hello everyone...

I have a quation here says
Bulldust Inc. blends silicon and nitrogen to produce two types of fertiliser. Fertiliser 1
must be at least 40% nitrogen and sells for $20/kg. Fertiliser 2 must be at least 70% silicon and sells for$18/kg. Bulldust can purchase up to 800 kg of nitrogen at $10/kg and up to 1000 kg of silicon at$8/kg. Assuming that all fertiliser produced can be sold,
formulate an LP to help Bulldust maximize profit.

Ive tried so many different ways but still cant get the right answer.. could please someone help me answering this question

thanks.

Show us one of your ways. Do you know what the answer is? Also, look here: http://www.mathhelpforum.com/math-he...lp-checks.html

This same question was posted by another member. Are you the same two persons?

4. Originally Posted by CaptainBlack
Let $\displaystyle x_1$ and $\displaystyle x_2$ be the number of kg's of fertilizer 1 and 2 produced respectivley.

Let $\displaystyle y_1$ and $\displaystyle y_2$ be the proportion of N in f1 and f2 respectivly,

Then the cost is:

$\displaystyle c=x_1[10y_1+8(1-y_1)]+x_2[10y_2+8(1-y_2)]$

and the revenue is:

$\displaystyle r=20x_1+18x_2$

so the profit is:

$\displaystyle p=x_1[20-2y_1-8]+x_2[18-2y_2-8]=x_1[12-2y_1]+x_1[12-2y_2]$

This last is the objective (note its not linear unless $\displaystyle y_1$ and $\displaystyle y_2$ are fixed).

We have constaints:

$\displaystyle y_1 \ge 0.4$

$\displaystyle 0 \le y_2 \le 0.3$

$\displaystyle y_1x_1+y_2x_2 \le 800$

$\displaystyle (1-y_1)x_1+(1-y_2)x_2 \le 1000$

$\displaystyle x_1 \ge 0$

$\displaystyle x_2 \ge 0$

Again note this is not a linear programming problem unless the $\displaystyle y$'s are fixed.

RonL
One thing you could do is to assume a number of mixtures for f1 and f2 and solve the resulting LPs and take as the full solution that of the mixture that gives tha largest maximum profit. (Of course it just might be that the 30/70 and 40/60 mixtures are the ones that maximise profits, but it will have to be demonstrated)

RonL

5. ## NO way

No we arent the same two people...we are just doing the same assignment