Scribd
Upload
29 views1 page

Linear Programming

The document contains two examples of linear programming problems involving farmers minimizing costs or maximizing profits by allocating resources between crops under various constraints. The first problem involves minimizing costs by choosing amounts of fertilizer while meeting nitrogen and phosphate needs. The optimal solution is to buy 8 sacks of Crop-Quick and no Super-Gro. The second problem involves maximizing profits from rice and corn on 8 hectares of land, where planting 2 hectares of rice and 6 of corn is optimal.

Uploaded by

Zian Paderanga
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
29 views1 page

Linear Programming

The document contains two examples of linear programming problems involving farmers minimizing costs or maximizing profits by allocating resources between crops under various constraints. The first problem involves minimizing costs by choosing amounts of fertilizer while meeting nitrogen and phosphate needs. The optimal solution is to buy 8 sacks of Crop-Quick and no Super-Gro. The second problem involves maximizing profits from rice and corn on 8 hectares of land, where planting 2 hectares of rice and 6 of corn is optimal.

Uploaded by

Zian Paderanga
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/ 1

1.

Decision X1 = Number of sacks of Supper-Gor


Variable; X2= Number of sacks of Crop-Quick

Objective Minimize; Z = $6X1 + $3X2


Function;

Resource 2X1 + 4X2 ≥ 16 lb Nitrogen


Constraints; 4X1 + 3X2 ≥ 24 lb Phospate

Non-Negative Constrants; X1 ≥ 0, X2 ≥ 0

(3,5) = 33
(0,8) = 24
(0,9) = 27
(0,10) = 30

To minimize the cause. The farmer needs to buy 8 sacks of the Crop-Quick and
none or 0 of the Super-Gro.

2.
Decision X1 = Number of hectares of the rice
Variable; X2 = Number of hectares of the corn

Objective Maximum; Z = 5,000.00X1 + 3,000.00X2


Function;

Resource 2X1 + X2 ≥ 10 Galons


Constraints; X1 + X2 ≥ 8 Hectars

Non-Negative Constrants; x1 ≥ 0, x2 ≥ 0

(2,6) = 28,000
(3,4) = 27,000
(4,2) = 26,000
(5,0) = 26,000

To Maximize the profit. The farmer needs to plant 2 hectares of rice and 6 hectares
of corn in the farmer 8 hectares land and the profit of the farmer will be 28,000php

You might also like