The optimal solution to this LP is z $5,$ x$16,$ x$20,$ s$1$

$0,$ s$2$

$0,$ s$3$

$5,$ s$1$

$2,$

s$2$

$0,$ s$3$

$0,$ which agrees with the solution obtained by the preemptive goal programming

method. The z$-$value of $5$ indicates that if goals $1$ and $2$ are met, then the best that Priceler can do

is to come within $5$ million exposures of meeting goal $3$