Fill in the order form to get the price

Subject

Category

Deadline

Timezone:

Title *

Task *

{"ops":[{"insert":"JOY leather, a manufacturer of leather Products, makes three types of belts A, B and C which are processed on three machines M1, M2\n\u00a0and M3\n. Belt A requires 2 hours on machine(M1)\n\u00a0and 3 hours on machine (M2)\n\u00a0and 2 hours on machine (M3). Belt B requires 3 hours onmachine (M1)\n, 2 hours on machine (M2)\n\u00a0and 2 hours on machine (M3)\n\u00a0and Belt C requires 5hours on machine (M2) \nand 4 hours on machine (M3)\n. There are 8 hours of time per dayavailable on machine M1\n, 10 hours of time per day available on machine M2\n\u00a0and 15 hoursof time per day available on machine M3\n. The profit gained from belt A is birr 3.00 per unit,from Belt B is birr 5.00 per unit, from belt C is birr 4.00 per unit. What should be the daily\u00a0production of each type of belt so that the profit is maximum? \na)\nFormulate the problem as LPM\nb)\nSolve the LPM using simplex algorithm.\nc)\nDetermine the range of feasibility, optimality and insignificance\nd)\nInterpret the shadow price\n"}]}

I need basic explanations

Special Requirements

Upload files (if required)

Drop files here to upload

Add files...

Account info

Already have an account?

Name *

E-mail *

Password *

The password must be at least 6 characters.

I agree with terms & conditions