Scribd
Upload
19 views4 pages

Mon Thu 2

Uploaded by

Nguyễn T. Hà
Copyright
© © All Rights Reserved
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
19 views4 pages

Mon Thu 2

Uploaded by

Nguyễn T. Hà
Copyright
© © All Rights Reserved
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/ 4

Let x be the number of grams of ingredient 1 and y be the number of grams of ingredient 2.

The objective function is to minimize the cost of the drug, which is given by:
C = 80x + 50y
The constraints are as follows:

 The drug requires 6 units of antibiotic 1, which is contributed by 3x units from ingredient
1 and y units from ingredient 2. Therefore, the constraint is:

3x + y >= 6

 At least 4 units of antibiotic 2 are required, and each gram of ingredient 1 and ingredient
2 contributes 1 unit each. Therefore, the constraint is:

x + y >= 4

 At least 12 units of antibiotic 3 are required, which is contributed by 2x units from


ingredient 1 and 6y units from ingredient 2. Therefore, the constraint is:

2x + 6y >= 12
The non-negativity constraints are:
x >= 0, y >= 0
To solve this model using graphical analysis, we can plot the constraints on a graph and find the
feasible region. The feasible region is the region that satisfies all the constraints. The optimal
solution is the point in the feasible region that minimizes the objective function.
Here’s a graph of the constraints:
The feasible region is the shaded region in the graph. The vertices of the feasible region are (0,
6), (2, 2), and (4, 0).
To find the optimal solution, we evaluate the objective function at each vertex:

 At (0, 6), C = 80(0) + 50(6) = 300


 At (2, 2), C = 80(2) + 50(2) = 260
 At (4, 0), C = 80(4) + 50(0) = 320

Therefore, the optimal solution is to use 2 grams of ingredient 1 and 2 grams of ingredient 2 to
produce the drug at a minimum cost of $260.
Let x be the number of home driveways to be cleared, and y be the number of business parking
lots to be cleared. Then, the objective function is to maximize profit, which is given by:
Profit = 35x + 120y - (12x + 47y)
The first term represents the revenue from home driveways, the second term represents the
revenue from business parking lots, and the third term represents the variable cost of clearing
snow.
The constraints are as follows:

 x + y ≤ 65 (demand constraint)
 x ≤ 40 (home driveway constraint)
 y ≤ 25 (business parking lot constraint)
 x, y ≥ 0 (non-negativity constraint)

To solve this model graphically, we can plot the feasible region determined by the constraints
and then find the corner points of the region. The optimal solution will be the corner point that
maximizes the objective function.
However, since the number of variables is only two, we can also use the corner-point method to
solve the problem. This involves evaluating the objective function at each corner point of the
feasible region and selecting the corner point that maximizes the objective function. The corner
points of the feasible region are:

 (0, 0)
 (0, 25)
 (40, 0)
 (15, 50)

Evaluating the objective function at each corner point, we get:

 (0, 0): Profit = 0


 (0, 25): Profit = 2,725
 (40, 0): Profit = 1,020
 (15, 50): Profit = 4,050

Therefore, the optimal solution is to clear 15 home driveways and 50 business parking lots,
which will maximize the profit to $4,050.
The Bluegrass Distillery produces custom-blended whiskey. The company has received an order
for a minimum of 400 gallons of the custom blend. The customer specified that the order must
contain at least 40% rye and not more than 250 gallons of bourbon. The blend should be mixed
in the ratio of two parts rye to one part bourbon. The distillery can produce 500 gallons per
week, regardless of the blend. The production manager wants to complete the order in 1 week.
The blend is sold for $5 per gallon. The distillery company’s cost per gallon is $2 for rye and $1
for bourbon. The company wants to determine the blend mix that will meet customer
requirements and maximize profits.
To formulate a linear programming model for this problem, we can use the following variables:

 Let x be the amount of rye whiskey in gallons.


 Let y be the amount of bourbon whiskey in gallons.
The customer specified that the order must contain at least 40% rye, which gives a constraint of x
>= (0.40) (400), or x >= 160. The customer also specified that the order must not contain
more than 250 gallons of bourbon, which gives a constraint of y <= 250. The customer also
specified that the blend should be mixed in the ratio of two parts rye to one part bourbon. Thus,
this gives the constraint of x + 2y >= 400.
The distillery can produce 500 gallons in one week, regardless of the blend. Thus, this gives the
constraint of x + y <= 500.
Since the blend is sold for $5 per gallon, and costs $2 for rye and $1 for bourbon, the objective
function is Z = Amount sold - Cost. If we want to maximize profit, the objective function is Z
= 5(x + y) - (2x + y), or Z = 3x + 4y.

Overall, the constraints are:

 x >= 160
 y <= 250
 x + 2y >= 400
 x + y <= 500
 x >= 0
 y >= 0

Now we can solve the linear program. This can be done graphically. First, we must put the
constraints in standard form, y = mx + b. Thus, the constraints become:

 x >= 160
 y <= 250
 y >= -1/2x + 200
 y <= -x + 500
 x >= 0
 y >= 0

We can now solve this model by finding all of the intersection points in the feasible region of the
graph. The intersection points are:

 (160, 200)
 (240, 120)
 (250, 250)
 (400, 100)
 (500, 0)

The optimal solution is (240, 120), which means that the distillery should produce 240 gallons
of rye whiskey and 120 gallons of bourbon whiskey to meet the customer’s requirements and
maximize profits. The total profit will be $1,320.

Let x be the number of driveways to be cleared and y be the number of parking lots to be cleared.
The objective is to maximize profit, which is given by:
P = 23x + 73y
The constraints are:

 The total number of jobs should not exceed the demand: x + y ≤ 65


 The number of driveways cleared should not exceed the demand: x ≤ 40
 The number of parking lots cleared should not exceed the demand: y ≤ 25
 The time taken to clear all driveways and parking lots should not exceed the available
time: x + 4y ≤ 60
 The time taken to clear all driveways and parking lots should not exceed the available
time: x + 4y ≤ 60

The decision variables are:


x ≥ 0 and y ≥ 0
To solve this model graphically, we can plot the feasible region and find the corner points. The
feasible region is the region that satisfies all the constraints. The corner points are the points
where the lines intersect. We can then evaluate the objective function at each corner point to find
the maximum profit.

You might also like