A new furniture shop wants to optimize their profit in producing exclusive beds and chairs. Each bed yields a profit of
Posted: Sat May 14, 2022 4:30 pm
A new furniture shop wants to optimize their profit in producing
exclusive beds and chairs. Each bed yields a profit of R10.00 and
each chair yields a profit of R8.00. For a production period of one
week, 80 Labor hours are available for the abolstery department and
50 hours are available for the final assembly department. Each bed
requires 4 hours in the abolstery department and 1 hour in the
final assembly department. Each chair requires 2 hours in the
abolstery department and 2 hours in the final assembly department.
Formulate the production mix of beds and chairs for the furniture
shop as a LP problem and then solve it using the Simplex algorithm
to determine how many beds and chairs should be produced each week
to optimize their profits. Let : Beds = X1 Chairs = X2
Calculate the optimal solution by using the Simplex method,
using the transformed LP constraints and objective Function
exclusive beds and chairs. Each bed yields a profit of R10.00 and
each chair yields a profit of R8.00. For a production period of one
week, 80 Labor hours are available for the abolstery department and
50 hours are available for the final assembly department. Each bed
requires 4 hours in the abolstery department and 1 hour in the
final assembly department. Each chair requires 2 hours in the
abolstery department and 2 hours in the final assembly department.
Formulate the production mix of beds and chairs for the furniture
shop as a LP problem and then solve it using the Simplex algorithm
to determine how many beds and chairs should be produced each week
to optimize their profits. Let : Beds = X1 Chairs = X2
Calculate the optimal solution by using the Simplex method,
using the transformed LP constraints and objective Function