A travel company operates two types of vehicles, P and Q. Vehicle P can carry 40 passengers and 30 tons of baggage. Vehicle Q can carry 60 passengers but only 15 tons of baggage. The travel company is contracted to carry at least 960 passengers and 360 tons of baggage per journey. If vehicle P costs RM1000 to operate per journey and vehicle Q costs RM1200 to operate per journey, what choice of vehicles will minimize the total cost per journey. Formulate the problem as a linear programming model.