«Home

Can Any Mathematician In The Room Solve This Linear Programming Problem?

Maximise: Z= 4x1 + 6x2

Subject to: x1 – 3x2 ≥ 8

2x1 + x2 ≥ 0

5x1 + 3x2 ≥ 45

X1 > 0 , x2 ≥ 0

Avatar
Newbie
9 answers

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.

0
Avatar
Newbie

@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.

0
Avatar
Newbie

never seen a maths like this

0
Avatar
Newbie

@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.

0
Avatar
Newbie

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?

0
Avatar
Newbie

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

0
Avatar
Newbie

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

0
Avatar
Newbie

x= -1

please ignore just kidding

0
Avatar
Newbie
Your answer
Add image

By posting your answer, you agree to the privacy policy and terms of service.