Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
2K views3 pages

Maximization

The manufacturer can maximize profit of $36 by producing 4 tables and 6 desks. The constraints on assembling, buffing, and crating hours limit production. Graphing the constraint equations shows the feasible region. The isoprofit line within this region indicates the optimal solution of 4 tables and 6 desks.

Uploaded by

Dinesh Simmadorai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2K views3 pages

Maximization

The manufacturer can maximize profit of $36 by producing 4 tables and 6 desks. The constraints on assembling, buffing, and crating hours limit production. Graphing the constraint equations shows the feasible region. The isoprofit line within this region indicates the optimal solution of 4 tables and 6 desks.

Uploaded by

Dinesh Simmadorai
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Question 1: Maximization A manufacturer makes wooden desks (X ) and tables (Y). Each desk requires 2.

5 hours to assemble, 3 hours for buffing, and 1 hour to crate. Each table requires 1 hour to assemble, 3 hours to buff, and 2 hours to crate. The firm can do only up to 20 hours of assembling, 30 hours of buffing, and 16 hours of crating per week. Profit is $3 per desk and $4 per table. Maximize the profit. Let , x = number of desks y = number of tables Objective function: maximize profit = 3x + 4y
The constraints are shown below

assembling 2.5x + y 20 buffing 3x + 3y 30 crating x + 2y 16 non-negativity x0 y 0 First step in graphical solution 1. The first step is convert the constraint inequalities into equalities Then, plot the constraints on the graph.

2.5x + y = 20 -------- 1 3x + 3y =30 -------- 2 x + 2y =16 --------3

From equation 1, when x=0 , y=20 while x=8 when y=0 For equation 2, when x=0, y=10, while x=10 when y=0 For equation 3, when x=0, y=8, while x=16 when y=0

Using all this condition, the graph is plotted as shown below.

2. Second step Shade the feasible solution area. A feasible are is the area on the graph bounded by the constraint equation. 3. Third step Find the optimal solution. We can use either Isoprofit solution method is being used in this case. Taking any point in the boundry region, for example, x= 2, y=2 Z = 3x + 4y Z = 10(2) + 8(2) = 36 36 = 3x + 4y, when x= 0 y= 9 and when y=0 x= 12

Ploting this on the graph will yield the isoprofit line.

The black line in the graph is the isoprofit line. In order to maximize cost, from the graph, it is shown that x= 4 and y=6. Where, Z = 3x + 4y Z = 3(4) + 4(6) = 36 In conclusion, the manufacturer has to produce 4 tables and 6 desks in order to maximize profit which is $36.

You might also like