Custom order request

Find or creating real world applications of system of linear inequalities related to

data science or area of an interest to you. Provide a little description of the scenario
and model the situation. Solve the system and interpret the results.

Problem:

Farmer Jones must determine how many acres of corn and wheat to plant this year. An acre of
wheat yields 25 bushels of wheat and requires 10 hours of labor per week. An acre of corn yields
10 bushels of corn and requires 4 hours of labor per week. All wheat can be sold at $4 a bushel,
and all corn can be sold at $3 a bushel. Seven acres of land and 40 hours per week of labor are
available. Government regulations require that at least 30 bushels of corn be produced during the
current year. Let x1 = number of acres of corn planted, and x2 = number of acres of wheat
planted. Using these decision variables, formulate an LP whose solution will tell Farmer Jones
how to maximize the total revenue from wheat and corn.

Solution.

Step 1.

Let x1 be the number of acres of corn planted and x2 be the number of acres of wheat planted.

Person Jones wants to maximize the total revenue from corn and wheat planted. His weekly
revenues are calculated as follows.

Weekly revenues = weekly revenue from corn + weekly revenue from wheat

= {(dollars / corn bushel) (corn bushel/acre) + (dollars / wheat bushel)

(wheat bushel/acre)}

= (3x10)x1+ (4x25)x2

= 30x1+ 100x2

Thus the objective function is :

Max z = 30x1+ 100x2

Step 2.

The constraints are as follows:

Constraint 1: Seven acres of land is available:

Constraint 2: 40 hours of labour are available each week.

Constraint 3: At least 30 bushels of corn must be produced.

Constraint 1 can be expressed in terms of x1 and x2.

Acres of land in which corn is planted + Acres of land in which wheat is planted ≤ 7.

x1 + x2 ≤ 7

Constraint 2 can be expressed in terms of x1 and x2

= {(labour/week) (no. of acres of corn planted)

+(labour/week) (no. of acres of wheat planted) } ≤ 40

= 4x1 + 10 x2 ≤ 40

Constraint 3 can be expressed in terms of x1 and x2

= {(bushels/week) (no. of acres of corn planted/week)≥ 30

= 10 x1 ≥30

Therefore the mathematical model of given L.P is:

Maximize the following equation:

Max z = 30x1+ 100x2

Subject to constraints is:

x1 + x2 ≤ 7

4x1 + 10 x2 ≤ 40

10 x1 ≥30
Solution:
Problem is
Max  3
= x1 + 100 x2
Z 0
subject to
x1 + x2 ≤ 7
4 x1 + 10 x2 ≤ 40
1
x1 ≥ 30
0
and x1,x2≥0;

The problem is converted to canonical form by adding slack, surplus and artificial
variables as appropriate

1. As the constraint-1 is of type '≤' we should add slack variable S1

2. As the constraint-2 is of type '≤' we should add slack variable S2

3. As the constraint-3 is of type '≥' we should subtract surplus variable S3 and add artificial
variable A1

After introducing slack, surplus, artificial variables

Max 
= 30 x1 + 100 x2 + 0 S1 + 0 S2 + 0 S3 - M A1
Z
subject to

x1 + x +S =7
2 1

4 x1 + 10 x2 + S2 = 40
1
x1 - S3 + A1 = 30
0
and x1,x2,S1,S2,S3,A1≥0

Iteration-1 Cj 30 100 0 0 0 -M

B CB XB x1 x2 S1 S2 S3 A1 Min Ratio

S1 0 7 1 1 1 0 0 0 71=7

S2 0 40 4 10 0 1 0 0 404=10

A1 -M 30 (10) 0 0 0 -1 1 3010=3→

Z=-30M Zj -10M 0 0 0 M -M

Zj-Cj -10M-30↑ -100 0 0 M 0

Negative minimum Zj-Cj is -10M-30 and its column index is 1. So, the entering variable is x1.

Minimum ratio is 3 and its row index is 3. So, the leaving basis variable is A1.

∴ The pivot element is 10.

Entering =x1, Departing =A1, Key Element =10

R3(new)=R3(old)÷10

R1(new)=R1(old) - R3(new)

R2(new)=R2(old) - 4R3(new)

Iteration-2 Cj 30 100 0 0 0

Min Ratio
B CB XB x1 x2 S1 S2 S3

S1 0 4 0 1 1 0 0.1 41=4

S2 0 28 0 (10) 0 1 0.4 2810=2.8→

x1 30 3 1 0 0 0 -0.1 ---

Z=90 Zj 30 0 0 0 -3

Zj-Cj 0 -100↑ 0 0 -3

Negative minimum Zj-Cj is -100 and its column index is 2. So, the entering variable is x2.

Minimum ratio is 2.8 and its row index is 2. So, the leaving basis variable is S2.

∴ The pivot element is 10.

Entering =x2, Departing =S2, Key Element =10

R2(new)=R2(old)÷10
R1(new)=R1(old) - R2(new)
R3(new)=R3(old)
 Iteration-3 Cj 30 100 0 0 0

B CB XB x1 x2 S1 S2 S3 Min Ratio

S1 0 1.2 0 0 1 -0.1 0.06

x2 100 2.8 0 1 0 0.1 0.04

x1 30 3 1 0 0 0 -0.1

Z=370 Zj 30 100 0 10 1

Zj-Cj 0 0 0 10 1

Since all Zj-Cj≥0

Hence, optimal solution is arrived with value of variables as:

x1=3, x2=2.8

Max Z=370