Question

求解一道运筹学的题目 关于linear programming的 谢谢指点

A money manager deals with French currency(Franc) and American currency. At 12 midnight, he can buy francs by paying 25 dollar per franc and dollars by paying 3 francs per dollar. Let x=number of dollars bought(by paying francs) and y=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. He must have a nononegative number of francs and dollar.
Q1: Formulate an Linear Programming that enbles him to maximize the number of dollars he has after all transactions are complete.
Q2:Graphically solve the LP and comment on the answer.

Answer 1

能不能帮忙翻译一下，中文的会做。