Required: St. Mary'S University Faculty of Business Department of Management Operation Research Assignment One (10%)
Required: St. Mary'S University Faculty of Business Department of Management Operation Research Assignment One (10%)
MARY’S UNIVERSITY
FACULTY OF BUSINESS
DEPARTMENT OF MANAGEMENT
OPERATION RESEARCH ASSIGNMENT ONE(10%)
5. Production A, B and C are sold door, product A costs $3 per unit to make, takes 10
minutes to sell and costs $0.50 to deliver to customers. B costs $5 per unit to make, takes
15 minutes to sell and is left with the customer at the time of sale. C costs $4, takes 12
minutes to sell, and costs $1 to deliver. During any given week, a sales man is allowed to
draw up to $ 500 worth of A, B and C at cost and delivery expenses not exceeding $ 75.
If a salesman’s selling time is not expected to exceed 30 hours in a week, and the
salesman’s profit (net after all expenses) is $1 each on a unit of A and B and $2 on a unit
of C. what combination of sales of A, B and C will lead to maximum profit.
Required. A. Formulate the linear programming model for the problem
B. Solve it using simplex algorithm
C. Give proper interpretation for the optimal solution.