Money manager Boris Milkem deals with French currency (the franc) and American currency (the dollar). At 12 midnight, he can buy francs by paying 25 dollars per franc and dollars by paying 3 francs per dollar. Let x1 = number of dollars bought (by paying francs) and x2 = number of francs bought (by paying dollars). Assume that both types of transactions take place simultaneously, and the only constraint is that at 12:01 a. m. Boris must have a nonnegative number of francs and dollars. a Formulate an LP that enables Boris to maximize the number of dollars he has after all transactions are completed.

b Graphically solve the LP and comment on the answer.