Related questions with answers

Suppose that you go into business raising Thoroughbreds and quarter horses. Having studied linear programming, you decide to maximize the feasible profit you can make. Let xx be the number of Thoroughbreds, and let yy be the number of quarter horses you raise each year.
a. Write inequalities expressing each of the following requirements:
i. Your supplier can get you at most 20 Thoroughbreds and at most 15 quarter horses to raise each year.
ii. You must raise at least 12 horses, total, each year to make the business worthwhile.
iii. A Thoroughbred eats 2 tons of food per year, but a quarter horse eats 6 tons per year. You can handle no more than 96 tons of food per year.
iv. A Thoroughbred requires 1000 hours of training per year. and a quarter horse only 250 hours per year. You have enough personnel to do at most 10,000 hours of training per year.
b. Draw a graph of the feasible region.
c. One of the inequalities has no effect on the feasible region. Which one? Tell what this means in the real world.
d. What is the minimum feasible number of quarter horses?
e. What is the maximum feasible number of Thoroughbreds?
f. Is it feasible to raise no Thoroughbreds? Explain.
g. You can make a profit of $500\$ 500 for each Thoroughbred and $200\$ 200 for each quarter horse. Shade the portion of the feasible region in which the profit would be at least $5000\$ 5000 per year.
h. What is the maximum feasible profit you could make per year, and how would you operate in order to attain that profit?
i. How much more profit do you make per year by operating at the optimum point of part h\mathrm{h} rather than by operating at the worst feasible point?

Question

Productco produces three products. Each product requires labor, lumber, and paint. The resource requirements, unit price, and variable cost (exclusive of raw materials) for each product are given in Table 70. Currently, 900 labor hours, 1,550 gallons of paint, and 1,600 board feet of lumber are available. Additional labor can be purchased at $6 per hour, additional paint at$2 per gallon, and additional lumber at $3 per board foot. For the following two sets of priorities, use preemptive goal programming to determine an optimal production schedule. For set 1: Priority 1: Obtain profit of at least$10,500. Priority 2: Purchase no additional labor. Priority 3: Purchase no additional paint. Priority 4: Purchase no additional lumber. For set 2: Priority 1: Purchase no additional labor. Priority 2: Obtain profit of at least $10,500. Priority 3: Purchase no additional paint. Priority 4: Purchase no additional lumber. TABLE 70:

ProductLaborLumberPaintPrice ($)Variable Cost ($)11.523261023322863242317\begin{matrix} \text{Product} & \text{Labor} & \text{Lumber} & \text{Paint} & \text{Price (\$)} & \text{Variable Cost (\$)}\\ \text{1} & \text{1.5} & \text{2} & \text{3} & \text{26} & \text{10}\\ \text{2} & \text{3} & \text{3} & \text{2} & \text{28} & \text{6}\\ \text{3} & \text{2} & \text{4} & \text{2} & \text{31} & \text{7}\\ \end{matrix}

Solution

Verified
Step 1
1 of 2

Three products are produced at productco, each of which requires labor, lumber and paint. 900900 hours of labor, 15501550 gallons of paint and 16001600 board feet of lumber are avialable. Additional labor is priced at $6\$6 per hour, additional paint at $2\$2 per gallon and additional lumber at $3\$3 per board foot. Ofcourse, we are to use preemptive goal programming to determine an optimal production schedule. Let us x1,x2x_1,x_2 and x3x_3 be the decision variables that denote the number of products 1,21,2 and 33 (respectively) sold. Also let us y1,y2y_1,y_2 and y3y_3 be the number of additional labor, paint and lumber purchased. The highest priority is to obtain a profit of at least $10500.\$10\,500. Then we have (with adding deviational variables):

16x1+22x2+24x36y12y23y3+s1s1+=10500.16x_1+22x_2+24x_3-6y_1-2y_2-3y_3+s_1^--s_1^+=10500.

The second highest priority is to purchase no additional labor, followed by no additional paint and lumber :

y1+s2s2+=0,y2+s2s2+=0,y3s3s3+=0.y_1+s_2^--s_2^+=0,y_2+s_2^--s_2^+=0,y_3-s_3^--s_3^+=0.

Ofcourse, all variables are nonnegative. Therefore, our aim is to observe the following expression:

(P1s1+P2s2++P3s3++P4s4+)min.(P_1s_1^-+P_2s_2^++P_3s_3^++P_4s_4^+)\rightarrow\min.

For the set 22 we established that the highest prioirty goal is to purchase no additional labor which implies:

y1+s1s1+=0.y_1+s_1^--s_1^+=0.

It is followed by priority 22 which is obtaining at least $10500\$10\,500 of profit:

16x1+22x2+24x36y12y23y3+s2s2+=10500.16x_1+22x_2+24x_3-6y_1-2y_2-3y_3+s_2^--s_2^+=10500.

Similarly we have:

y2+s3s3+=0,y3+s4s4+=0.y_2+s_3^--s-3^+=0,y_3+s_4^--s_4^+=0.

Therefore we minimize P1s1++P2s2+P3s3++P4s4+.P_1s_1^++P_2s_2^-+P_3s_3^++P_4s_4^+. Thus, we are done.

Create an account to view solutions

Create an account to view solutions

Recommended textbook solutions

Introduction to Operations Research 10th Edition by Frederick S. Hillier

Introduction to Operations Research

10th EditionISBN: 9780073523453Frederick S. Hillier
Verified solutions
Operations Research: Applications and Algorithms 4th Edition by Wayne L Winston

Operations Research: Applications and Algorithms

4th EditionISBN: 9780534380588 (8 more)Wayne L Winston
1,439 solutions
STAT: Behavioral Sciences 2nd Edition by Gary Heiman

STAT: Behavioral Sciences

2nd EditionISBN: 9781305436923Gary Heiman
A Mathematical Look at Politics 1st Edition by Daniel H. Ullman, E. Arthur Robinson Jr.

A Mathematical Look at Politics

1st EditionISBN: 9781439819838Daniel H. Ullman, E. Arthur Robinson Jr.

More related questions

1/4

1/7