Scribd
Upload
24 views2 pages

Lanto-Complete Optimal Solution

The linear programming problem aims to minimize costs represented by the objective function C = 3X + 3Y. The optimal solution involves producing 4 units of X and 2 units of Y, resulting in a total cost of $18. All constraints are satisfied with the produced amounts exceeding the available limits for each constraint.

Uploaded by

Dana Lanto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
24 views2 pages

Lanto-Complete Optimal Solution

The linear programming problem aims to minimize costs represented by the objective function C = 3X + 3Y. The optimal solution involves producing 4 units of X and 2 units of Y, resulting in a total cost of $18. All constraints are satisfied with the produced amounts exceeding the available limits for each constraint.

Uploaded by

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

Find the complete optimal solution to this linear programming problem.

OBJECTIVE FUNCTION
Minimize: C = 3X + 3Y

SUBJECT TO CONSTRAINTS
12X + 4Y ≥ 48
10X + 5Y ≥ 50
4X + 8Y ≥ 32
X,Y ≥ 0

PRODUCTS PRODUCED
Constraints
X Y Available
1 12 4 48
2 10 5 50
3 4 8 32
Cost 3 3

MODEL
DECISION VARIABLES
X Y
Unit Produced 4 2

Minimize Total Cost $ 18.00

Constraints: Amount used Amount Available


1 56.00 >= 48
2 50.00 >= 50
3 32.00 >= 32

*Complete optimal solution


If the cost is $3 per X unit and $3 per Y unit, there should be 4 X
units and 2 Y units to minimize the cost up to $18.
*Complete optimal solution

You might also like