Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Only solve parts b,c,d, and e! Tunction. ltel as CT Then use Solver to solve the

ID: 3044772 • Letter: O

Question



Only solve parts b,c,d, and e! Tunction. ltel as CT Then use Solver to solve the model. a SUMPROD- e. Summarize the model in algebraic form. . Ed Butler is the production manager for the Bilco Cor- noration, which produces three types of spare parts for automo- biles. The manufact of two machines, with the following processing times (in hours). Benefit g on each Part Machine Unit cost 0.02 0.05 0.03 0.02 0.05 0.04 Each machine is available 40 hours per month. Each part manufactured will yield a unit profit as follows: ti of Part d Ex Profit $50 $40 S30 E 3.11. Consid following data. Ed maximize total profit. wants to determine the mix of spare parts to produce to Identify both the activities and the resources for this resource-allocation problem a. b. Formulate a linear programming mod for th Benefit 1 problem on a spreadsheet. mal soltion. Use the spreadsheet to check each e for feasibility and, if feasible, for the value of Q 1 e objective function. Which feasible guess has the R3 ree guesses of your own choosing for the Unit cost $40 best objective function value?

Explanation / Answer

In this resource allocation problem, we note the following

Available Machines 2 with available time on each machine 40 hours per month.

Production of three parts A,B,C with per unit profit $50, $40, $30.

Assume that U,V and W number of units of parts A,B and C are to be produced,

Then LPP is formulated as follows:

Objective function:

Z=50 U+40 V+30 W

Subject to constraints,

Constraint on Machine 1: 0.02 U+ 0.03 V+ 0.05 W 40

Constraint on Machine 2: 0.05 U+ 0.02 V+ 0.04 W 40

GUESS

U

V

W

TIME ON MACHINE 1

TIME ON MACHINE 2

Z

1

400

300

350

34.5

40

42500

2

410

350

390

38.2

43.1

46200

3

125

325

225

23.5

21.75

26000

From Table please note three guesses. Out of which Guess 2 is not feasible as Time required on Machine 2 is beyond the available.

Guess 1 and Guess 3 are feasible, out of which Guess 3 is not proper as it under utilizes the resources. Guess 2 is better as it tries utilize the better resources and generate the profit of $42500.

GUESS

U

V

W

TIME ON MACHINE 1

TIME ON MACHINE 2

Z

1

400

300

350

34.5

40

42500

2

410

350

390

38.2

43.1

46200

3

125

325

225

23.5

21.75

26000