Scribd
Upload
5 views5 pages

exampl problems

The document presents example solutions for linear programming problems, specifically for Moore's Meatpacking Company, which aims to minimize costs for a hot dog mixture made from chicken and beef. It outlines the decision variables, objective function, and constraints, followed by a graphical method to determine the feasible solution area and optimal solution. The optimal solution is found at point B, with 2 pounds of chicken and 4 pounds of beef, resulting in a cost of 28.

Uploaded by

Salih Akadar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views5 pages

exampl problems

The document presents example solutions for linear programming problems, specifically for Moore's Meatpacking Company, which aims to minimize costs for a hot dog mixture made from chicken and beef. It outlines the decision variables, objective function, and constraints, followed by a graphical method to determine the feasible solution area and optimal solution. The optimal solution is found at point B, with 2 pounds of chicken and 4 pounds of beef, resulting in a cost of 28.

Uploaded by

Salih Akadar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Example Problem Solutions Page 1 of 5

[Page 57 (continued)]

Example Problem Solutions


As a prelude to the problems, this section presents example solutions to two linear
programming problems.

Problem Statement
Moore's Meatpacking Company produces a hot dog mixture in 1,000-pound batches. The
mixture contains two ingredientschicken and beef. The cost per pound of each of these
ingredients is as follows:

Ingredient Cost/lb.

Chicken $3
Beef $5

[Page 58]

Each batch has the following recipe requirements:

a. At least 500 pounds of chicken

b. At least 200 pounds of beef

The ratio of chicken to beef must be at least 2 to 1. The company wants to know the optimal
mixture of ingredients that will minimize cost. Formulate a linear programming model for this
problem.

Solution

Step 1. Identify Decision Variables

Recall that the problem should not be "swallowed whole." Identify each part of the
model separately, starting with the decision variables:

x1 = lb. of chicken

x2 = lb. of beef

Step 2. Formulate the Objective Function

Step 3.
Establish Model Constraints

mk:@MSITStore:C:\Users\MSFuser\Desktop\private%20document\Prentice.Hall.Intro... 2/26/2025
Example Problem Solutions Page 2 of 5

The constraints of this problem are embodied in the recipe restrictions and (not to
be overlooked) the fact that each batch must consist of 1,000 pounds of mixture:

and

x 1, x2 0

The Model

Problem Statement
Solve the following linear programming model graphically:

[Page 59]

Solution

Step 1.

Plot the Constraint Lines as Equations

A simple method for plotting constraint lines is to set one of the constraint variables
equal to zero and solve for the other variable to establish a point on one of the
axes. The three constraint lines are graphed in the following figure:

The constraint equations

mk:@MSITStore:C:\Users\MSFuser\Desktop\private%20document\Prentice.Hall.Intro... 2/26/2025
Example Problem Solutions Page 3 of 5

Step 2. Determine the Feasible Solution Area

The feasible solution area is determined by identifying the space that jointly
satisfies the conditions of all three constraints, as shown in the following figure:

The feasible solution space and extreme points

Step 3.
Determine the Solution Points

The solution at point A can be determined by noting that the constraint line
intersects the x2 axis at 5; thus, x2 = 5, x1 = 0, and Z = 25. The solution at point D
on the other axis can be determined similarly; the constraint intersects the axis at
x1 = 4, x2 = 0, and Z = 16.

mk:@MSITStore:C:\Users\MSFuser\Desktop\private%20document\Prentice.Hall.Intro... 2/26/2025
Example Problem Solutions Page 4 of 5

[Page 60]

The values at points B and C must be found by solving simultaneous equations.


Note that point B is formed by the intersection of the lines x1 + 2x2 = 10 and 6x1 +
6x2 = 36. First, convert both of these equations to functions of x1:

and

Now set the equations equal and solve for x2:

Substituting x2 = 4 into either of the two equations gives a value for x1:

x1 = 6 x2

x1 = 6 (4)

x1 = 2

Thus, at point B, x1 = 2, x2 = 4, and Z = 28.

At point C, x1 = 4. Substituting x1 = 4 into the equation x1 = 6 x2 gives a value for


x 2:

4 = 6 x2

x2 = 2

Thus, x1 = 4, x2 = 2, and Z = 26.

Step 4.

Determine the Optimal Solution

The optimal solution is at point B, where x1 = 2, x2 = 4, and Z = 28. The optimal


solution and solutions at the other extreme points are summarized in the following
figure:

Optimal solution point

mk:@MSITStore:C:\Users\MSFuser\Desktop\private%20document\Prentice.Hall.Intro... 2/26/2025
Example Problem Solutions Page 5 of 5

mk:@MSITStore:C:\Users\MSFuser\Desktop\private%20document\Prentice.Hall.Intro... 2/26/2025

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy