Scribd
Upload
229 views1 page

The Onato Company Produces Chairs

The Onato Company produces chairs, lamps, and tables that require different amounts of time on three machine centers (A, B, C) and have different profit amounts. The problem is to determine the number of each product to make to maximize total profit, given the daily machine center time availabilities and individual product profit amounts.

Uploaded by

Maddyyy
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
229 views1 page

The Onato Company Produces Chairs

The Onato Company produces chairs, lamps, and tables that require different amounts of time on three machine centers (A, B, C) and have different profit amounts. The problem is to determine the number of each product to make to maximize total profit, given the daily machine center time availabilities and individual product profit amounts.

Uploaded by

Maddyyy
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/ 1

The Onato Company produces chairs, lamps and tables.

Each pairs requires 6 minutes in machine center


a, 5 minutes in machine center B, and 8 minutes in machine center C. Each lamp produced requires 5, 4
and 5 minutes in machine center A, B and C respectively. Likewise, each tables produced requires 6, 4
and 6 minutes in machine center A, B and C respectively. The company has the daily availability of 2,400
minutes in machine center a, 2, 000 minutes in machine center B and 3, 000 in machine center C. Each
chair gives ₱50 profit, a lamp gives ₱100 and a table gives ₱200. Find the number of each type of
products to produce in order to maximize the company profit.

Solution:

Product Machine Machine Machine Profit


Center A Center B Center C
(in min.) (in min.) (in min.) (in peso)
Let x – be no. of cabinet 6 5 8 50
y – be no. of chairs 5 4 5 100
Z – be no. of tables 6 4 6 200
2,400 2,000 3,000

Objective Function and Constraints:

Maximize P: 50𝑥 + 100𝑦 + 200𝑧


6𝑥 + 5𝑦 + 6𝑧 ≤ 2,400

Subject to: {5𝑥 + 4𝑦 + 4𝑦 ≤ 2,000

8𝑥 + 5𝑦 + 6𝑧 ≤ 3,000
𝑥; 𝑦; 𝑧 ≥ 0

New Program with Slack Variables (Sn):

Maximize P: 50𝑥 + 100𝑦 + 200𝑧 + 0𝑆1 + 0𝑆2 + 0𝑆3

6𝑥 + 5𝑦 + 6𝑧 + 𝑆1 = 2,400
Subject to: {5𝑥 + 4𝑦 + 4𝑦 + 𝑆2 = 2,000
8𝑥 + 5𝑦 + 6𝑧 + 𝑆3 = 3,000
𝑥; 𝑦; 𝑧 ≥ 0
𝑆1 ; 𝑆2; 𝑆3 ≥ 0

You might also like