Scribd
Upload
0 views5 pages

Linear Programming Problem Solution Enhanced

A factory produces chairs and tables, with profits of $50 per chair and $80 per table. The production is constrained by 240 hours of carpentry and 180 hours of painting work available weekly. To maximize profit, the factory should produce 30 chairs and 40 tables, resulting in a maximum profit of $4700.

Uploaded by

contehraymondak
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
0 views5 pages

Linear Programming Problem Solution Enhanced

A factory produces chairs and tables, with profits of $50 per chair and $80 per table. The production is constrained by 240 hours of carpentry and 180 hours of painting work available weekly. To maximize profit, the factory should produce 30 chairs and 40 tables, resulting in a maximum profit of $4700.

Uploaded by

contehraymondak
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

Linear Programming Problem Example

A factory makes chairs and tables. The profit from each chair is $50 and from each table is
$80. Each chair requires 4 hours of carpentry work and 2 hours of painting work. Each table
requires 3 hours of carpentry work and 3 hours of painting work. The factory has 240 hours
of carpentry work and 180 hours of painting work available per week. Determine how many
chairs and tables the factory should produce to maximize profit.

Example: A Factory Producing Chairs and Tables

A factory makes chairs and tables.

• The profit from each chair is $50

• The profit from each table is $80

Each chair requires:

• 4 hours of carpentry work

• 2 hours of painting work

Each table requires:

• 3 hours of carpentry work

• 3 hours of painting work

🛠 The factory has:

• 240 hours of carpentry work available per week

• 180 hours of painting work available per week

The goal: How many chairs and tables should the factory produce to maximize
profit?

Step 1: Define decision variables

Let:

• x= number of chairs produced per week


• y= number of tables produced per week

Step 2: Write the objective function

We want to maximize profit:

Profit=50x+80y

Objective function:

Max Z=50x+80y

Step 3: Write the constraints

Carpentry hours constraint:

4x+3y≤240

Painting hours constraint:

2x+3y≤180

Non-negativity:

x≥0, y≥0

Step 4: Formulate the complete LPP

Maximize Z=50x+80y

subject to:

4x+3y≤240

2x+3y≤180

x≥0, y≥0

Step 5: Solve graphically (for 2 variables)


We can plot the constraints on a graph:
Draw the lines:

• 4x+3y=240

• 2x+3y=180

Identify feasible region where all constraints are satisfied.

Find corner (vertex) points of the feasible region.

Calculate Z at each corner point to find the maximum.

Let's compute the corner points:

Point A: Intersection of carpentry & painting constraints


Solve:

4x+3y=240

2x+3y=180

Subtract second from first:

(4x+3y)−(2x+3y)=240−180

2x=60

⇒ x=30

Substitute into second:

2(30)+3y=180

⇒60+3y=180

⇒3y=120

⇒y=40

So, Point A = (30, 40)

Point B: Where 4x+3y=240 meets y-axis (x=0):

4(0) +3y=240⇒y=80
Point C: Where 2x+3y=180 meets y-axis (x=0):

2(0) +3y=180⇒y=60

Point D: Where 2x+3y=180 meets x-axis (y=0):

2x=180⇒x=90

Point E: Where 4x+3y=240 meets x-axis (y=0):

4x=240⇒x=60

Step 6: Compute profit at each corner point

Point (x,y) Z = 50x + 80y

A (30,40) 50×30 + 80×40 = 1500 + 3200 = 4700

B (0,80) 0 + 6400 = 6400 (but violates painting hours)

C (0,60) 0 + 4800 = 4800

D (90,0) 4500 + 0 = 4500 (but violates carpentry hours)

E (60,0) 3000 + 0 = 3000

Maximum profit is at A (30 chairs, 40 tables): $4700

Final Answer

The factory should produce 30 chairs and 40 tables to achieve maximum profit of
$4700 within the resource limits.

Formulation
Let x = number of chairs produced per week

Let y = number of tables produced per week

Objective function: Maximize Z = 50x + 80y

Subject to:
4x + 3y ≤ 240 (carpentry constraint)

2x + 3y ≤ 180 (painting constraint)

x ≥ 0, y ≥ 0

Graph

You might also like