SOLUTION: A tourist agency can sell up to 1200 travel packages for a football game. The package includes airfare, weekend accommodations, and the choice of two types of flights: a nonsto
Algebra.Com
Question 73060This question is from textbook Algebra 2
: A tourist agency can sell up to 1200 travel packages for a football game. 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. The agency can locate no more than 10 planes for the travel packages. Each package with nonstop flight sells for $1200, and each package with a two-stop flight sells for $900. Assume that each plane will carry the maximum number of passengers. What is the linear inequalities to represent the constraints?How would you graph it and how would it look? What are the coordinates of the vertices of the febsible region?
This question is from textbook Algebra 2
Answer by stanbon(75887) (Show Source): You can put this solution on YOUR website!
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.
RELATED QUESTIONS
How would you solve the following problem?:
A tourist agency can sell up to 1200 travel... (answered by ankor@dixie-net.com)
A tourist agency can sell up to 1200 travel packages for a football game. The package... (answered by ankor@dixie-net.com)
a tourist agency can sell up to 1200 packages for a football game. the package includes... (answered by ankor@dixie-net.com)
A tourist agency can sell up to 1200 travel packages for a football game. The package... (answered by ankor@dixie-net.com)
A tourist agency can sell up to 1200 travel packages for a football game. The package... (answered by stanbon)
A tourist agency can sell up to 1200 travel packages for a football game. The package... (answered by ankor@dixie-net.com)
Can you help me with the constraints on this linear programming question?
A tourist... (answered by ankor@dixie-net.com)
A local travel agent can sell up to 1200 travel packages for a concert. The packages will (answered by ankor@dixie-net.com)
Peaceful Travel Agency offers vacation packages. Each vacation package includes a city, a (answered by stanbon)