```Question 73060
A tourist agency can sell up to 1200 travel packages for a football game.
non-stop +two-stop <=1200
----------------
The package includes airfare, weekend accommodations, and the choice of two types of flights: a nonstop flight or a two-stop flight. The nonstop flight can carry up to 150 passengers, and the two-stop flight can carry up to 100 passengers.
0<=n<=150
0<=t<=100
---------------
The agency can locate no more than 10 planes for the travel packages.
p<=10
-------------
Each package with nonstop flight sells for \$1200,
Total Value of non-stops is 1200n
---------------
Each package with a two-stop flight sells for \$900.
Total Value of two-stops is 900t
---------------
Assume that each plane will carry the maximum number of passengers.
-----------------
How do you suppose to graph this feasible region?
n <= -t+1200
0<=n<=150
0<=t<=100
===========
COMMENT: You have not stated an "objective" function that can
be evaluated using the coordinates of the intersections of the
above inequality lines.
Also you seem to be missing another inequality statement that
would relate n and t.
==================
What are the coordinates of the vertices of the feasible region?
(0,0)
If n=150, t=1050 giving you (150,1050)
==============
Cheers,
Stan H.

```