Maximise: Z= 4x1 + 6x2
Subject to: x1 – 3x2 ≥ 8
2x1 + x2 ≥ 0
5x1 + 3x2 ≥ 45
X1 > 0 , x2 ≥ 0

x= -1

please ignore just kidding

SNOWDROPS
simple maths like this,u no fit solve,infact,u must come to nairaland school tomorrow with your mummy.

, (sings for you) olodo rabata,oju eja lo mo je,oo ni loo paper,silati lo ma lo,a jiyon wo,eba tutu lo mo je.
, snowdrops,my son,i sent you to school,u dony know how to maths.

volasunkan:

SNOWDROPS
simple maths like this,u no fit solve,infact,u must come to nairaland school tomorrow with your mummy.

, (sings for you) olodo rabata,oju eja lo mo je,oo ni loo paper,silati lo ma lo,a jiyon wo,eba tutu lo mo je.
, snowdrops,my son,i sent you to school,u dony know how to maths.

OK now. Agreed i no know maths.

Tell us the answer Mr Professor.

I'm ready to solve it, but how much will you pay?

Thats not for Jambites, right? Its like a 400 level exam question!

Timsezeh:

Maximise: Z= 4x1 + 6x2
Subject to: x1 – 3x2 ≥ 8
2x1 + x2 ≥ 0
5x1 + 3x2 ≥ 45
X1 > 0 , x2 ≥ 0

If i may ask, what level are you now? This LP problem requires you to use the big M method or Revised simplex method to solve it. I hope you know those methods?

@funmi2010 and ishmael, you both are right. can you help me? I've being trying to solve it for days now but i'm not getting it right.

:os

never seen a maths like this

@snowdrops,wait let me get my mortar and pestle to "pound" the life-threatening maths.


@ ismael,abeg pity d guy,d guy may turn out to be ur protege,@ poster,make u dobale and beg ishmael well well,person wey u meet for aba ni baba,whoever can solve this maths is above percuniary gains,if na project,make u acknowledge him and mail him a copy.ishmael i hail oh.

it's a complex LP problem. I'm too busy with work now, but i will try and look for time to solve it. Take kia.

I don't know what is Linear Programming but because of you, i checked my my mentor which is http://www.wikipedia.com and i found something u might be interested with. link is http://en.wikipedia.org/wiki/Linear_programming

Example

Suppose that a farmer has a piece of farm land, say A square kilometres large, to be planted with either wheat or barley or some combination of the two. The farmer has a limited permissible amount F of fertilizer and P of insecticide which can be used, each of which is required in different amounts per unit area for wheat (F1, P1) and barley (F2, P2). Let S1 be the selling price of wheat, and S2 the price of barley. If we denote the area planted with wheat and barley by x1 and x2 respectively, then the optimal number of square kilometres to plant with wheat vs barley can be expressed as a linear programming problem:

Maximize: S1x1 + S2x2 (maximize the revenue — revenue is the "objective function"
Subject to: x1 + x2 ≤ A (limit on total area)
F1x1 + F2x2 ≤ F (limit on fertilizer)
P1x1 + P2x2 ≤ P (limit on insecticide)
x1 ≥ 0, x2 ≥ 0 (cannot plant a negative area).

Which in matrix form becomes: