Figure shows a printout from a linear programming package. Explain what these results show. How could the format of the results beimproved?

Transcribed Image Text:

-=*=- INFORMATION ENTERED -=*= PROBLEM NAME Manheim Service NUMBER OF VARIABLES PrAbatches of Service Product A PrBbatches of Service Product B PrCbatches of Service Product C NUMBER OF < CONSTRAINTS NUMBER OF = CONSTRAINTS NUMBER OF >= CONSTRAINTS MAXIMISE Profit 10 PrA +5 PrB+ 3 PrC SUBJECT TO: Constraint 1 120 PrA + 23 PrB + 10 PrC <-1,545 Constraint 2 150 PrA35 PrB10 PrC550 Constraint 3 100 PrA+15 PrB +SS PrC <- 679 -= *=- RESULTS -*-- Optimal solution found 4 iterations OBJECTIVE FUNCTION VALUE: 51.5S VARIABLE OPTIMAL ORIGINAL INCREASE VALUE 3.24 0 6.38 NEEDED 0 3.07 PROFIT 10 PrA PrB PrC CONSTRAINT ORIGINAL RIGHT-HAND VALUE 1,545 550 675 USED SLACK OR SHADoW SURPLUS PRICE 452.76 092.24 Constraint 1 Constraint 2 Constraint 3 550 675 0.034 0.048 0 --'-- SENSITIVITY ANALYSIS OBJECTIVE FUNCTION COEFFICIENTS VARIABLE PrA PrB PrC LOWER LIMIT 5,46 1.93 0.67 ORIGINAL COEFFICIENT 10 UPPER LIMIT 22.54 no limit 5.5 SHADOW PRICES VALID IN RHS RANGES CONSTRAINT Constraint 1 Constraint 2 Constraint 3 LOWER LIMIT 452.76 122.73 366.67 ORIGINAL VALUBE 1,545 550 675 UPPER LIMIT no limit 1,012.5 3,025 --*=- END OF ANALYSIS --*=-