Scribd
Upload
34 views

OR4 Odt

The Whitt Window Company makes two types of windows and wishes to determine the optimal production quantities to maximize profit. The linear programming model has decision variables X1 for wood-framed windows and X2 for aluminum-framed windows. The objective is to maximize total profit of $300X1 + $150X2 subject to constraints on employee work capacities and glass availability. Weenies and Buns produces hot dogs and buns to maximize profit. The linear programming model has decision variables X1 for hot dogs and X2 for buns. The objective is to maximize total profit of $0.88X1 + $0.33X2 subject to constraints on flour, pork, and labor availability.

Uploaded by

Wajini Lakshika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
34 views

OR4 Odt

The Whitt Window Company makes two types of windows and wishes to determine the optimal production quantities to maximize profit. The linear programming model has decision variables X1 for wood-framed windows and X2 for aluminum-framed windows. The objective is to maximize total profit of $300X1 + $150X2 subject to constraints on employee work capacities and glass availability. Weenies and Buns produces hot dogs and buns to maximize profit. The linear programming model has decision variables X1 for hot dogs and X2 for buns. The objective is to maximize total profit of $0.88X1 + $0.33X2 subject to constraints on flour, pork, and labor availability.

Uploaded by

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

Formulation of Linear Programming Problem

1. The Whitt Window Company, a company with only three employees, makes two different kinds of
hand-crafted windows: a wood-framed and an aluminum-framed window. The company earns $300
profit for each wood-framed window and $150 profit for each aluminum-framed window. Doug makes
the wood frames and can make 6 per day. Linda makes the aluminum frames and can make 4 per day.
Bob forms and cuts the glass and can make 48 square feet of glass per day. Each wood-framed window
uses 6 square feet of glass and each aluminum-framed window uses 8 square feet of glass.

The company wishes to determine how many windows of each type to produce per day to maximize
total profit. Formulate the linear programming model for this problem.

Solution:

Employees Wood-framed Aluminum-framed Available

Doug 1 0 6

Linda 0 1 4

Bob 6 8 48

Profit $300 $150

Decision variable:

X1 = Wood-framed

X2 = Aluminum-framed

Objective function:
Maximize

Z = $300X1 + $150X2

Subject to:

X1 <= 6

X2 <= 4

6X1 + 8X2 <= 48

X1 >= 0 , X2 >= 0

2. Weenies and Buns is a food processing plant which manufactures hot dogs and hot dog buns. They
grind their own flour for the hot dog buns at a maximum rate of 200 pounds per week. Each hot dog
bun requires 0.1 pound of flour. They currently have a contract with Pigland, Inc., which specifies that
a delivery of 800 pounds of pork product is delivered every Monday. Each hot dog requires   pound of
pork product. All the other ingredients in the hot dogs and hot dog buns are in plentiful supply. Finally,
the labor force at Weenies and Buns consists of 5 employees working full time (40 hours per week
each). Each hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes of labor. Each
hot dog yields a profit of $0.88, and each bun yields a profit of $0.33.
Weenies and Buns would like to know how many hot dogs and how many hot dog buns they should
produce each week so as to achieve the highest possible profit.
Formulate a linear programming model for this problem.

Hot dog Hot dog buns Available

Flour 0 0.1 200

Pork 0.25 0 800

Labor 3 2 40

Profit $0.88 $0.33

Solution:
Decision variable:

X1 = Hot dog

X2 = Hot dog buns

Objective function:

Maximize

Z = $0.88X1 + $0.33X2

Subject to:

0.1X2 <= 200

0.25X1 <= 800

3X1 + 2X2 <= 40

X1 >= 0 , X2 >= 0

You might also like