0% found this document useful (0 votes)
9 views3 pages

Problem-on-Linear-Programming

The document presents two linear programming problems. The first problem involves maximizing airline profits by selling 25 first-class and 125 ordinary tickets, yielding a maximum profit of P331,250. The second problem focuses on a poultry raiser aiming to raise 100 chickens, 75 ducks, and 25 turkeys for a maximum profit of P15,750.
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
0% found this document useful (0 votes)
9 views3 pages

Problem-on-Linear-Programming

The document presents two linear programming problems. The first problem involves maximizing airline profits by selling 25 first-class and 125 ordinary tickets, yielding a maximum profit of P331,250. The second problem focuses on a poultry raiser aiming to raise 100 chickens, 75 ducks, and 25 turkeys for a maximum profit of P15,750.
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/ 3

Problem 1

An airline offers ordinary and first-class tickets. For the airline to be


profitable, it must sell a minimum of 25 first-class tickets and a minimum of
40 ordinary tickets. The company makes a profit of P2,250 for each ordinary
ticket and P2,000 for each first-class ticket. At most, the plane has a capacity
of 150 travelers.
a. How many of each ticket should be sold in order to maximize
profits?
b. How much is the maximum profit?
Solution:
This is a classic linear programming problem.

 x: Number of first-class tickets sold


 y: Number of ordinary tickets sold

Objective Function: Maximize profit = 2000x + 2250y

Constraints:

1. x ≥ 25 (minimum first-class tickets)


2. y ≥ 40 (minimum ordinary tickets)
3. x + y ≤ 150 (plane capacity)
4. x ≥ 0, y ≥ 0 (non-negativity constraints)

To solve this problem, we can use graphical methods or simplex method.


Since this is a simple problem, we can use graphical methods. Graphical
Solution: Plot the constraints on a graph:

1. x ≥ 25: vertical line at x = 25


2. y ≥ 40: horizontal line at y = 40
3. x + y ≤ 150: diagonal line with intercepts at x = 150 and y = 150

The feasible region is the area bounded by these lines. Corner Points:

1. (25, 40)
2. (25, 125)
3. (75, 75)
4. (125, 25)

Evaluate Objective Function at Corner Points:

1. (25, 40): 2000(25) + 2250(40) = 50,000 + 90,000 = 140,000


2. (25, 125): 2000(25) + 2250(125) = 50,000 + 281,250 = 331,250
3. (75, 75): 2000(75) + 2250(75) = 150,000 + 168,750 = 318,750
4. (125, 25): 2000(125) + 2250(25) = 250,000 + 56,250 = 306,250

Optimal Solution: The maximum profit occurs at the corner point (25,
125) with a profit of P331,250. Therefore, the airline should sell:

 25 first-class tickets
 125 ordinary tickets

to maximize profits.

Problem 2
A poultry raiser plans to raise chicken, ducks and turkeys. He has room for
only 200 birds and wishes to limit the number of turkeys to a maximum of
25, the number of turkeys and ducks to a maximum of 100. His estimated
profit is P60, P50 and P240 on each chicken, duck and turkey respectively.
a. How many of each should he raise to maximize profit?
b. How much is the maximum profit?

To solve this problem, we can use linear programming. Let's denote:

 x: Number of chickens
 y: Number of ducks
 z: Number of turkeys

Objective Function: Maximize profit = 60x + 50y + 240z Constraints:

1. x + y + z ≤ 200 (total number of birds)


2. z ≤ 25 (maximum number of turkeys)
3. y + z ≤ 100 (maximum number of ducks and turkeys)
4. x ≥ 0, y ≥ 0, z ≥ 0 (non-negativity constraints)

Using linear programming methods or a solver, we find:


Optimal Solution:
x = 100 (chickens)
y = 75 (ducks)
z = 25 (turkeys)
Maximum Profit: 60(100) + 50(75) + 240(25) = 6,000 + 3,750 + 6,000 =
15,750

Therefore:
A. The poultry raiser should raise 100 chickens, 75 ducks, and 25 turkeys to
maximize profit.
B. The maximum profit is P15,750.

You might also like