Scribd
Upload
2K views3 pages

BMATH3

The document presents a linear programming problem for a company that produces two products, X1 and X2, in two departments. The objective is to maximize total profit contribution given constraints on the department capacities. Using the LINDO software, the optimal solution is found to be 5 units of X1 and 1 unit of X2, providing a maximum profit contribution of 180. The document also presents a second linear programming problem to minimize total cost of producing two commodities given constraints on the quantities. The LINDO solution finds the optimal quantities as 4 units of X1 and 10 units of X2, providing a minimum total cost of 1480.

Uploaded by

Herrika Red Gullon Rosete
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
2K views3 pages

BMATH3

The document presents a linear programming problem for a company that produces two products, X1 and X2, in two departments. The objective is to maximize total profit contribution given constraints on the department capacities. Using the LINDO software, the optimal solution is found to be 5 units of X1 and 1 unit of X2, providing a maximum profit contribution of 180. The document also presents a second linear programming problem to minimize total cost of producing two commodities given constraints on the quantities. The LINDO solution finds the optimal quantities as 4 units of X1 and 10 units of X2, providing a minimum total cost of 1480.

Uploaded by

Herrika Red Gullon Rosete
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

I.

Problem (pg. 96, #1)


Angelines Handicraft manufactures two products in two departments. Product X1
contributes 26php and takes 6 hours in department 1, and 6 hours in department 2.
Product X2 contributes 50php and takes 8 hours in department 1 and 12 hours in
department 2. Department 1 has a capacity of 38 hours, and department 2 has a
capacity of 42 hours. Indicate the maximum level in units and maximum profit
contribution production level.

II.

Linear Programming
Objective:
Maximum Z = 26X1 + 50X2
Subject to 6X1 + 8X2 38
6X1 + 12X2 42
X1 0; X2 0

III.

LINDO
LP OPTIMUM FOUND AT STEP

OBJECTIVE FUNCTION VALUE


1)

180.0000

VARIABLE
VALUE
X1
5.000000
X2
1.000000

ROW
2)
3)
4)
5)

REDUCED COST
0.000000
0.000000

SLACK OR SURPLUS DUAL PRICES


0.000000
0.500000
0.000000
3.833333
5.000000
0.000000
1.000000
0.000000

NO. ITERATIONS=

RANGES IN WHICH THE BASIS IS UNCHANGED:


OBJ COEFFICIENT RANGES
VARIABLE
CURRENT
ALLOWABLE
ALLOWABLE
COEF
INCREASE
DECREASE

X1
X2

26.000000
50.000000

11.499999
2.000000

1.000000
15.333333

RIGHTHAND SIDE RANGES


ROW
CURRENT
ALLOWABLE
ALLOWABLE
RHS
INCREASE
DECREASE
2
38.000000
4.000000
10.000000
3
42.000000
15.000000
4.000000
4
0.000000
5.000000
INFINITY
5
0.000000
1.000000
INFINITY

I. Problem (Page 120)


A company produces two commodities X1 and X2 and wishes to minimize cost =
120X1 + 100X2, subject to constrain 2X1 + X2 18 and 5X1 + 4x2 60. Determine the
optimal quantities of each commodity to produce and associated cost.

II. Linear Program


Objective:
Subject to:

MIN Z = 120X1 + 100X2


2X1 + X2 18
5X1 + 4x2 60
X1, X2 0

III. LINDO
LP OPTIMUM FOUND AT STEP

OBJECTIVE FUNCTION VALUE


1)

1480.000

VARIABLE
VALUE
X1
4.000000
X2
10.000000

ROW
2)
3)
4)
5)

REDUCED COST
0.000000
0.000000

SLACK OR SURPLUS DUAL PRICES


0.000000
6.666667
0.000000
-26.666666
4.000000
0.000000
10.000000
0.000000

NO. ITERATIONS=

RANGES IN WHICH THE BASIS IS UNCHANGED:

OBJ COEFFICIENT RANGES


CURRENT
ALLOWABLE
ALLOWABLE
COEF
INCREASE
DECREASE
120.000000
5.000000
INFINITY
100.000000
INFINITY
4.000000

VARIABLE
X1
X2

RIGHTHAND SIDE RANGES


ROW
CURRENT
ALLOWABLE
ALLOWABLE
RHS
INCREASE
DECREASE
2
18.000000
6.000000
3.000000
3
60.000000
12.000000
15.000000
4
0.000000
4.000000
INFINITY
5
0.000000
10.000000
INFINITY

SUBMITTED BY: Group 1


1. Lacson, Kimberly C.
2. Cabo, Kriszelle Ann M.
3. Rosete, Herrika Red G.
4. Fuentes, Vane Mitch P.
5. Mamacang, Roselle Kathareen C.

You might also like