Scribd
Upload
35 views

HW MFB Trap8

1. The document lists the names and student IDs of 4 students. 2. It then provides solutions to 3 optimization problems involving maximizing and minimizing linear functions subject to linear inequality constraints. The solutions find the optimal point by solving the constraint equations simultaneously. 3. For each problem, the feasible region is identified based on the constraint lines, and the objective function value at each corner point is calculated to determine the optimal solution.

Uploaded by

Tran Do
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
35 views

HW MFB Trap8

1. The document lists the names and student IDs of 4 students. 2. It then provides solutions to 3 optimization problems involving maximizing and minimizing linear functions subject to linear inequality constraints. The solutions find the optimal point by solving the constraint equations simultaneously. 3. For each problem, the feasible region is identified based on the constraint lines, and the objective function value at each corner point is calculated to determine the optimal solution.

Uploaded by

Tran Do
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/ 8

1.

Đỗ Ngọc Trân BABAWE20121 (2/522) (4/545)


2. Thái Hạnh Chi - BABAIU20536 - ( 3/545)
3. Võ Quỳnh Như Ngọc - BABAIU20479 (7/523)
4. Mai Huỳnh Mỹ Duyên - BABAIU20489 (1/523)
Tran
2/522
a. 7x-3y=4
2x+5y=7 5 4
Det(AX)= | |=5(5)-12(4)=-23
7 −3 12 5
A=[ ]
2 5 det (AX) 7
X= =
4 −3 det (𝐴) 23
AX=[ ]
7 5
c) x+4y=9
7 −3
Det(A)=| |=7(5)-(-3)(2)=41 2x-7y=3
2 5
4 −3 1 4
Det(AX)= | |=4(5)-(-3)7=41 A=[ ]
7 5 2 −7
det (AX) 41 9 4
X= = =1 AX=[ ]
det (𝐴) 41 3 −7
b. 3x+4y=5 1 4
Det(A)=| |=1(-7)-4(2)=-15
2x+5y=12 2 −7

3 4 9 4
A=[ ] Det(AX)= | |=9(-7)-3(4)=-75
2 5 3 −7
det (AX) −15
5 4 X= = =0.2
AX=[ ] det (𝐴) −75
12 5
3 4
Det(A)=| |=3(5)-4(2)=7
2 5
4/545
a. Maximise 4x + 9y
subject to
5x + 3y ≤ 30
7x + 2y ≤ 28
x≥0
y≥0
The line 5x + 3y = 30 passes through (0, 10) and (6, 0).
The line 7x + 2y = 28 passes through (0, 14) and (4, 0).
Because the 2 inequality signs are all ‘≤’, We are therefore interested in the region below all of
these lines

Also, at the test point (0, 0) the inequality


5x + 3y ≤ 30 reads 0 ≤ 30
7x + 2y ≤ 28 reads 0 ≤ 28
which is obviously true. We are therefore interested in the region below the line, since
this contains the origin.

The non-negativity constraints x ≥ 0 and y ≥ 0 indicate that the region is bounded by the
coordinate axes in the positive quadrant.
by solving simultaneous equations with an algebraic method.
5x + 3y = 30
7x + 2y = 28
The point at the intersection 2 lines is (24/11, 70/11)
The feasible region has four corners, (0, 10), (4, 0), (24/11, 70/11) and (0, 0)

Corner Objective function

(0, 10) 4(0) + 9(10)=90


(4, 0) 4(4) + 9(0)=16
(24/11, 70/11) 4(24/11) + 9(70/11)=66
(0, 0) 4(0) + 9(0)=0

Hence the Maximum of the function is 90, which occurs at (0, 10).

b. Maximise 3x + 6y
subject to
2x + 5y ≤ 20
x+y≤5
x≥0
y≥0
The line 2x + 5y = 20 passes through (0, 4) and (10, 0).
The line x + y = 5 passes through (0, 5) and (5, 0).
Because the 2 inequality signs are all ‘≤’, We are therefore interested in the region below all of
these lines

Also, at the test point (0, 0) the inequality


2x + 5y ≤ 20 reads 0 ≤ 20
x + y ≤ 5 reads 0 ≤ 5
which is obviously true. We are therefore interested in the region below the line, since
this contains the origin.

The non-negativity constraints x ≥ 0 and y ≥ 0 indicate that the region is bounded by the
coordinate axes in the positive quadrant.
by solving simultaneous equations with an algebraic method.
2x + 5y = 20
x+y=5
The point at the intersection 2 lines is (5/3, 10/3)
The feasible region has four corners (0, 4), (5, 0) (0,0) and (5/3, 10/3)
Corner Objective function

(0, 4) 3x + 6y= 3(0)+6(4)=24


(5, 0) 3x + 6y= 3(5) +6(0)=15
(5/3, 10/3) 3x + 6y= 3(5/3) + 6(10/3)=25
(0, 0) 3x + 6y=0

Hence the Maximum of the function is 25, which occurs at (5/3, 10/3)( by solving simultaneous equations
with an algebraic method as presented above )

c. Minimise x + y
subject to
x - 2y ≤ 3
x-y≤4
x≥1
y≥0
The line x - 2y = 3 passes through (9, 3) and (3, 0).
The line x - y = 4 passes through (5, 1) and (4, 0).
Because the 2 inequality signs are all ‘≤’, We are therefore interested in the region below all of
these lines

With x ≥ 1, Also, the test point (0, 0) does not satisfy any of the corresponding constraints

The non-negativity constraints x ≥ 1 and y ≥ 0 indicate that the region is bounded by the
x-axes in the line y=1.

by solving simultaneous equations with an algebraic method.


x - 2y = 3
x-y=4
The point at the intersection 2 lines is (5, 1)
The feasible region has three corners (5, 1), (1, 0), (3,0)
Corner Objective function

(1, 0) x + y= 1 + 0=1
(5, 1) x + y= 5 + 1=6
(3, 0) x + y= 3 + 0=3

Minimum is 1, which occurs at (1, 0).


Hence the Maximum of the function is 25, which occurs at (5/3, 10/3)

CHI 3/345
NGOC (7/523)
DUYEN 1/523

You might also like