- 25 Marks
QMFD – APR 2024 – L2 – Q1 – Linear Programming in Delivery Optimization
Formulate and solve a linear programming problem using graphical method to minimize running costs for two lorries delivering minimum quantities of two products with capacity and usage constraints.
Question
Dokument Courier Services has two Vans which it uses for deliveries. The first (X) can carry 10 of Product A or 4 of Product B. The second (Y) can carry 3 of A or 5 of Product B. Minimum deliveries are 200 of A and 150 of B. In order to maintain roadworthiness, each lorry must be used for a minimum of two journeys per week. Suppose the running costs are GHS20000.00 per journey for Lorry X and GHS 15000.0 per journey for Lorry Y. find the number of deliveries made by each lorry to minimize costs. If the aim of the manager of Dokument is to minimize costs. (a) Identify the decision variables. (b) Formulate the problem into a linear programming problem (LPM). (c) Display the LPM on a graph and shade the critical region.
(d) Use the graphical approach to solving the LPM
Find Related Questions by Tags, levels, etc.
- Tags: critical region, Decision Variables, formulation, graph, graphical method, Linear Programming, Minimization
- Level: Level 2
