Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

The Canine Products company offers two dog foods, Frisky Pup and Husky Hound, that are made from a blend of cereal and meat. A package of Frisky Pup requires 1 pound of cereal and 1.5pounds of meat, and sells for \(7. A package of Husky Hound uses 2 pounds of cereal and 1 pound of meat, and sells for \)6. Raw cereal costs\(1per pound and raw meat costs\)2per pound. It also costslocalid="1658981348093" \(1.40to package the Frisky Pup and localid="1658981352345" \)0.60to package the Husky Hound. A total of localid="1658981356694" 240,000pounds of cereal and pounds of meat are available each month. The only production bottleneck is that the factory can only package 110,000bags of Frisky Pup per month. Needless to say, management would like to maximize profit.

(a) Formulate the problem as a linear program in two variables.

(b) Graph the feasible region, give the coordinates of every vertex, and circle the vertex maximizing profit. What is the maximum profit possible?

Short Answer

Expert verified

a)The problem as a linear program in two variables is given below.

b). The graph from above constraints is showing below of feasible region, give the coordinates of every vertex, and circle the vertex maximizing profit.

Step by step solution

01

Defining Maximum Profit

Let the packageproducebyFriskyPuppermonth=F.The package contains 1 pound of cereal and cost 1$/poundand 1.5 pound of meat and cost 2$/pound.

So,we will achieve maximum profit if we have:1.6F+1.4H

Here,

On solving above conditions in the question, maximum profit is:22.2×104

So total production cost include cost of production of cereal and meat and package cost(1.40$). This givelocalid="1658924309919" totalcostofproductionofapackage=1+2×1.5+1.40=5.4$..

Hence,localid="1658924239764" profitobtaininsellingapackage=Sellingprice-Costofproduction.

Profit=7-5.4=1.6$

So,maximumprofitofF=1.6F

Let thepackageproducebyHuskyHoundpermonth=H.The package contain 2 pound of cereal and cost 1$/poundand 1 pound of meat and costlocalid="1658981373747" 2$/pound.So total production cost include cost of production of cereal and meat and package cost (0.6$).This give localid="1658981380385" totalcostofproductionofapackage=2×1+2+0.6=4.6$.Hence, profitobtaininsellingapackage=Sellingprice-Costofproduction.1.6F+1.4H.

Profit=6-4.6=1.4$

So, max profitofH=1.4H

Therefore, max profitlocalid="1658923761946" =1.6F+1.4H

This is our optimal goal to achieve.

02

Define constraints

Total cereal available in a month F+2H240000pounds. Also, Frisky Pup and Husky Hound contain 1 pound and 2 pound cereal respectively.

So, the constraint is: F+2H240000

Total meat available in a monthH180000pounds. Also, Frisky Pup and Husky Hound contain 1.5 pound and 1 pound meat respectively. So,

the constraint is: H180000.

Frisky Pug can produce at the most localid="1658982614215" F110000package.

This can be expressed as:F110000 .

And the package quantity can never be negative.

Thus, our required linear program is:

Maximum:1.6H+1.4H

Constraints

[1]F+2H240000[2]1.5F+H180000[3]F110000[4]F0[5]H0

03

The graph is given as:

The graph from above constraints is:

In this graph,"denote power of 4 .

From the graph, it is clear that we will obtain maximum profit from

(F,H)=(6×104,9×104)

So, our maximum profit will be:

1.6F+1.4H=1.6×6×104+1.4×9×104=22.2×104

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

In a satisfiable system of linear inequalities

a11x1+···+a1nxnb1:am1x1+···+amnxnbm

we describe the inequality as forced-equal if it is satisfied with equality by every solution x = (x1,...,xn)of the system. Equivalently,Piajixibj is not forced-equal if there exists an x that satisfies the whole system and such that Piajixibj.

For example, in

x1+x22-x1-x2-2x11-x20

Give an example of a linear program in two variables whose feasible region is infinite, but such that there is an optimum solution of bounded cost.

A quadratic programming problem seeks to maximize a quadratic objective function (with terms like 3x12or5x1x2) subject to a set of linear constraints. Give an example of a quadratic program in two variables x1, x2 such that the feasible region is nonempty and bounded, and yet none of the vertices of this region optimize the (quadratic) objective.

Hollywood. A film producer is seeking actors and investors for his new movie. There are n available actors; actori chargesSj dollars. For funding, there arem available investors. Investorj will providepj dollars, but only on the condition that certain actorsLj{1,2,...,n} are included in the cast (all of these actorsLj must be chosen in order to receive funding from investorrole="math" localid="1658404523817" j ).

The producer’s profit is the sum of the payments from investors minus the payments to actors. The goal is to maximize this profit.

(a) Express this problem as an integer linear program in which the variables take on values {0,1}.

(b) Now relax this to a linear program, and show that there must in fact be an integral optimal solution (as is the case, for example, with maximum flow and bipartite matching).

For the following network, with edge capacities as shown, find the maximum flow from S to T, along with a matching cut.

See all solutions

Recommended explanations on Computer Science Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free