Hello good people , if you reside right in Lagos and you're good at solving operations research problems, please contact me urgently for a job. Also , if anyone has CIPM's Operations' Research and Insurance and Pensions management Text books to dispose , please contact me asap . Thanks!!!

Yeah sir, am good at it. Studying Industrial Engineering in University of ibadan but am still in sch tho. But I can help with questions if you can send them to me online

Ekuns007:
Yeah sir, am good at it. Studying Industrial Engineering in University of ibadan but am still in sch tho. But I can help with questions if you can send them to me online

.

Thanks very much Sir . Will do whenever I come across one !!!

Ok sir

Ok sir.

AdemolaA2:
Hello good people , if you reside right in Lagos and you're good at solving operations research problems, please contact me urgently for a job. Also , if anyone has CIPM's Operations' Research and Insurance and Pensions management Text books to dispose , please contact me asap . Thanks!!!

I have an OR textbook but I'm not ready to dispose it, you can contact me for the job anyways. Whatsapp O8I6 768 I837

I can also help out. My area of expertise include but not limited to network, transport/transhipment, project management, and modeling. Still a student of University of Ibadan, Mathematics Department as my brother above.

thankyouJesus:
I can also help out. My area of expertise include but not limited to network, transport/transhipment, project management, and modeling. Still a student of University of Ibadan, Mathematics Department as my brother above.

Are you knowledgeable in Linear programming ?

AdemolaA2:
Hello good people , if you reside right in Lagos and you're good at solving operations research problems, please contact me urgently for a job. Also , if anyone has CIPM's Operations' Research and Insurance and Pensions management Text books to dispose , please contact me asap . Thanks!!!

Have you gotten any CIPM past questions ?

spenca:


Have you gotten any CIPM past questions ?

I've gotten the textbooks but not the past questions . Have you got any past questions for me Sir ?

AdemolaA2:

I've gotten the textbooks but not the past questions . Have you got any past questions for me Sir ?

Nah, was hoping you would have some .
How is OR going ?

spenca:

Are you knowledgeable in Linear programming ?

I am knowledgeable in linear programming. Good evening

spenca:


Nah, was hoping you would have some .
How is OR going ?

.
Not too good !!!

kelvinreality:


I am knowledgeable in linear programming. Good evening

Oh nice , how can you help , I am able to formulate the linear problem, don't understand how to proceed

AdemolaA2:
.
Not too good !!!

Which can you solve ?

I know a little about LP and OR...

Can we have your questions here?

sangresan:
Can we have your questions here?

A bottling company produces Fanta orange and Fanta lemon. Each bottle of Fanta orange requires 1 hour of machining , 5 hours of labour and 3KG of material while each bottle of Fanta lemon requires 2 hours of machining 4hours of labour and 2KG of material. The bottling company has 700 hours of machining ,1700 hours of labour and 800KG of materials available to produce the two types of drink.

Formulate and solve the linear programming problem if the profit on every bottle of Fanta orange and Fanta lemon are N4 and N5 respectively .

Here we go

spenca:

Oh nice , how can you help , I am able to formulate the linear problem, don't understand how to proceed

I will continue from here when I am back from service. This problem can beloved using Graphical method or Simplex method, but I will be using Graphical method.

spenca:


Are you knowledgeable in Linear programming ?

Yes I am, just seeing the question, will try when back from church.

kelvinreality:


I will continue from here when I am back from service. This problem can beloved using Graphical method or Simplex method, but I will be using Graphical method.

okies , thanks would be expecting

thankyouJesus:
Yes I am, just seeing the question, will try when back from church.

okies, would be expecting
thanks in advance

spenca:


A bottling company produces Fanta orange and Fanta lemon. Each bottle of Fanta orange requires 1 hour of machining , 5 hours of labour and 3KG of material while each bottle of Fanta lemon requires 2 hours of machining 4hours of labour and 2KG of material. The bottling company has 700 hours of machining ,1700 hours of labour and 800KG of materials available to produce the two types of drink.

Formulate and solve the linear programming problem if the profit on every bottle of Fanta orange and Fanta lemon are N4 and N5 respectively .

Here we go

let a represents orange,
b represents fanta
Max z= 4a + 5b
subject to
a+2b <_ 700.
5a+4b <_ 1700.
3a+2b <_ 800.

thankyouJesus:

let a represents orange,
b represents fanta
Max z= 4a + 5b
subject to
a+2b <_ 700.
5a+4b <_ 1700.
3a+2b <_ 800.

Adding surplus variables
a+2b+c=700.
5a+4b+d=1700.
3a+2b+e=800.
z-4a-5b=0.

Using simplex algorithm, the answer is


calculating

thankyouJesus:

Adding surplus variables
a+2b+c=700.
5a+4b+d=1700.
3a+2b+e=800.
z-4a-5b=0.

Using simplex algorithm, the answer is


calculating

The optimal solutiin:
z=2000.
b=400.
This does not satisfy the first inequality. Will try with graphical method.

corner points using graphical method
(0,0), (0,350), (800/3 , 0) (50,325) (orange, lemon)


z=50(4)+325(5).

This is the right solution.

thankyouJesus:
corner points using graphical method
(0,0), (0,350), (800/3 , 0) (50,325) (orange, lemon)


z=50(4)+325(5).

This is the right solution.

Thank you so much
But the thing is I do not get the steps taken after formulating the LP problem sir. Can you pls explain how you went about it ?

spenca:


Thank you so much
But the thing is I do not get the steps taken after formulating the LP problem sir. Can you pls explain how you went about it ?

I'm sorry for the late reply, been busy with examination.

The first thing is to represents the inequalities on a graph paper.

The second thing is to mark out the area or section where all the points are intersected.

The third thing is to get the boundary values of the marked portion.

Substitute your points.

Pick the optimal since it's maximazation problem.