Moe is deciding how much Regular Duff beer and how much Duff Strong beer to order each week. Regular Duff costs Moe \(1 per pint and he sells it at \)2 per pint; Duff Strong costs Moe $1.50 per pint and he sells it at per pint. However, as part of a complicated marketing scam, the Duff company will only sell a pint of Duff Strong for each two pints or more of Regular Duff that Moe buys. Furthermore, due to past events that are better left untold, Duff will not sell Moe more than 3,000 pints per week. Moe knows that he can sell however much beer he has. Formulate a linear program for deciding how much Regular Duff and how much Duff Strong to buy, so as to maximize Moe’s profit. Solve the program geometrically.

Short Answer

Expert verified

In this, we will first define the constraints variables then define constraints mathematically, and then solve it graphically.

Step by step solution

01

Defining constraint variable

Let Moe order ‘R ’ regular duff beer per week.

It is given that Cost Price of Beer per Pint is=1$ and Selling Price of Beer per Pint is=2$

So profit obtain in regular duff beer per pints=2$-1$=1$

Let Moe order ‘’ Strong duff beer per week.

It is given that Cost Price of Beer per Pint is=1.5$ and Selling Price of Beer per Pint is=3$

So profit obtain in regular duff beer per pints=3$-1.5$=1.5$ .

This means that Moe earns profit by selling regular and strong duff beer=R+1.5S

02

Defining Constraints

It is said that, ‘Duff company will only sell a pint of Duff Strong for each two pints or more of Regular Duff that Moe buys’. This can be represented as: R2S.

Also, ‘Duff will not sell Moe more than 3,000 pints per week’. This can be express as:.

R+S3000.

As we know that quantity can never be negative. So R,S0.

So, our objective is to maximize the profit i.e.,

MaximizeR+1.5S.

Constraints:R2S

role="math" localid="1657275042140" R+S3000R,S0

03

Graph of Constraints

Constraints:

1R+S30002R2S3R,S0

From graph we can clearly see by interaction of constraints [1] and [2] at point R,S=1000,2000we will get our MAX revenue.

On, putting value of R,Sinrole="math" localid="1657275260361" R+1.55, we have:

1000+1.5x2000=1000+3000=4000$

Thus our maximunrevenue=4000$.

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

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.

Write the dual to the following linear program.

maxx+y2x+y3x+3y5x,y0

Find the optimal solutions to both primal and dual LPs

Hall’s theorem. Returning to the matchmaking scenario of Section 7.3, suppose we have a bipartite graph with boys on the left and an equal number of girls on the right. Hall’s theorem says that there is a perfect matching if and only if the following condition holds: any subset sof boys is connected to at least |s|girls.

Prove this theorem. (Hint: The max-flow min-cut theorem should be helpful.)

Matching pennies. In this simple two-player game, the players (call them Rand C) each choose an outcome, heads or tails. If both outcomes are equal, Cgives a dollar to R; if the outcomes are different, Rgives a dollar to C.

(a) Represent the payoffs by a2×2 matrix.

(b) What is the value of this game, and what are the optimal strategies for the two players?

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?

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