Consider a simple product mix problem where a furniture company tries to find an optimal product mix of four items: a desk (), a chair (), a cabinet (), and a bookcase (). Each item is processed in a stamping department (STAMP), an assembly department (ASSEMB), and a finishing department (FINISH). The time each item requires in each department is given in the input data. Because of resource limitations, each department has an upper limit on the time available for processing. Furthermore, because of labor constraints, the assembly department must work at least 300 hours. Finally, marketing tells you not to make more than 75 chairs, to make at least 50 bookcases, and to find the range over which the selling price of a bookcase can vary without changing the optimal product mix.
This problem can be expressed as the following linear program:
The following DATA step saves the problem specification as an MPS-format SAS data set:
data prodmix; infile datalines; input field1 $ field2 $ field3$ field4 field5 $ field6; datalines; NAME . PROD_MIX . . . ROWS . . . . . MAX PROFIT . . . . L STAMP . . . . L ASSEMB . . . . L FINISH . . . . COLUMNS . . . . . . DESK STAMP 3.0 ASSEMB 10 . DESK FINISH 10.0 PROFIT 95 . CHAIR STAMP 1.5 ASSEMB 6 . CHAIR FINISH 8.0 PROFIT 41 . CABINET STAMP 2.0 ASSEMB 8 . CABINET FINISH 8.0 PROFIT 84 . BOOKCSE STAMP 2.0 ASSEMB 7 . BOOKCSE FINISH 7.0 PROFIT 76 RHS . . . . . . TIME STAMP 800.0 ASSEMB 1200 . TIME FINISH 800.0 . . RANGES . . . . . . T1 ASSEMB 900.0 . . BOUNDS . . . . . UP BND CHAIR 75.0 . . LO BND BOOKCSE 50.0 . . ENDATA . . . . . ;