Total number andrew has available to spend : _x+_y (>,>=,<,<=) ___
minimum amount of bookcases that can be built:
x(<,<=,>,>=) ___
minimum amount of tv stands that can be built: y (<,<=,>,>=)___
vertices of the feasible region (0,0) (___,___) (0,__) (___,0)
optimization equation:
profit = ___x+ _y
andrews maximum profit is $_. He should build ___ bookcases and ___ tv stands