Unformatted text preview: n products you desire, and the m packages that the market oﬀers, formulate a linear program that models the problem of acquiring unit quantity of all n products at the minimum possible total cost . Your solutions may accept fractional packages. (You don’t have to solve the linear program; just formulate it.) 3. An automotive ﬁrm produces 3 types of cars: luxury, midsize, compact. These three types have gasoline mileage of 18, 29, and 38 miles/gallon, respectively. They generate proﬁts of $600, $460, and $320 per car, resp. The estimated demands are 600,00 units for luxury, 800,000 for midsize, and 700,000 for compact. Government regulations require that the average gasoline mileage for the company’s entire line of cars should be at least 30 miles/gallon. Formulate the linear programming model for this problem to maximize the company’s proﬁt. (You do not have to solve the problem; just describe the LP formulation.)...
View
Full Document
 Fall '09
 Vandam
 Operations Research, Linear Programming, Optimization, linear programming model, Combinatorial Algorithms

Click to edit the document details