Results 1 to 5 of 5

Math Help - linear programming

  1. #1
    Newbie
    Joined
    May 2008
    Posts
    1

    Thumbs down 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.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by maths4ever View Post
    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 x_1 and x_2 be the number of kg's of fertilizer 1 and 2 produced respectivley.

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

    Then the cost is:

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

    and the revenue is:

    r=20x_1+18x_2

    so the profit is:

    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 y_1 and y_2 are fixed).

    We have constaints:

    y_1 \ge 0.4

    0 \le y_2 \le 0.3

    y_1x_1+y_2x_2 \le 800

     <br />
(1-y_1)x_1+(1-y_2)x_2 \le 1000<br />

    x_1 \ge 0

     <br />
x_2 \ge 0<br />

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

    RonL
    Follow Math Help Forum on Facebook and Google+

  3. #3
    A riddle wrapped in an enigma
    masters's Avatar
    Joined
    Jan 2008
    From
    Big Stone Gap, Virginia
    Posts
    2,551
    Thanks
    12
    Awards
    1
    Quote Originally Posted by maths4ever View Post
    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?
    Follow Math Help Forum on Facebook and Google+

  4. #4
    Grand Panjandrum
    Joined
    Nov 2005
    From
    someplace
    Posts
    14,972
    Thanks
    4
    Quote Originally Posted by CaptainBlack View Post
    Let x_1 and x_2 be the number of kg's of fertilizer 1 and 2 produced respectivley.

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

    Then the cost is:

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

    and the revenue is:

    r=20x_1+18x_2

    so the profit is:

    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 y_1 and y_2 are fixed).

    We have constaints:

    y_1 \ge 0.4

    0 \le y_2 \le 0.3

    y_1x_1+y_2x_2 \le 800

     <br />
(1-y_1)x_1+(1-y_2)x_2 \le 1000<br />

    x_1 \ge 0

     <br />
x_2 \ge 0<br />

    Again note this is not a linear programming problem unless the 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
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Junior Member
    Joined
    Apr 2008
    Posts
    72

    NO way

    No we arent the same two people...we are just doing the same assignment
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Linear Programming~Please help!
    Posted in the Math Topics Forum
    Replies: 5
    Last Post: April 13th 2010, 02:12 PM
  2. Replies: 1
    Last Post: November 17th 2008, 04:18 AM
  3. linear programming
    Posted in the Pre-Calculus Forum
    Replies: 3
    Last Post: May 25th 2008, 07:40 AM
  4. Linear Programming
    Posted in the Math Topics Forum
    Replies: 3
    Last Post: February 19th 2008, 08:06 AM
  5. help linear programming
    Posted in the Pre-Calculus Forum
    Replies: 1
    Last Post: February 7th 2007, 01:30 AM

Search Tags


/mathhelpforum @mathhelpforum