Compilation Dbm3013 Engineering Mathematic 3 PDF

Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

DBM3013 ENGINEERING MATHEMATIC 3

QUESTION 1

a. Solve the matrix below by using Crout Method

1  3 2  x  8 
A= 4  1  1  y    9 
3 2 1  z  21
[ 18 marks ]

b. Find the real root for the equation below by using Fixed Point Iteration method with
iterative function xn1  6 x  20 . Given X0= 1.8. Give the answer write to 3
decimal places.

x2 + 6x – 20 = 0
[ 7 marks ]

QUESTION 2
a. Express the inequality for the following cases.
i. Total of x and y is less than 125.
ii. The area (A) of the shaded region is more than 350cm2
iii. Maximum value of z is 74.
iv. C exceed four times of D by 165 or less.
v. The ratio of y to x is 25 or more
(5 marks)

b. A hotel and conference center at a holiday destination can cater for a maximum of RM600
tourists and conference attendees per month but does not open for business in any month
in which the number of bookings is not less than 250. The number of tourist bookings is
always greater than or equal the number of conference attendees but never more than twice
as many. The profit made per tourist per month is RM15 while the profit made per
conference attendee per month is RM17. What mix of conference attendees and tourists
should the center aim for to maximize the profit and what is the maximum profit? ( Use
Corner Point Method to solve the problem)
(20 marks)
DBM3013 ENGINEERING MATHEMATIC 3
QUESTION 1

a. Based on the following equations :


2x  2 y  z  4
 4 x  2 y  10z  5
8 x  10 y  z  8
i. Rewrite the equations into matrix form of AX = B [1 mark]
ii. Using Doolittle’s Method, determine matrix L and matrix U [12 marks]

b. Find all 3(THREE) possible iterative functions for the polynomial equation

f ( x)  2 x 2  3 x  5  0 [ 6 marks ]
1
5−3𝑥 3
c. If the appropriate iterative function for f ( x)  5x  3x  5  0 is 𝑔(𝑥) =
3
( 5 ), and given

x0=0.5, what is the value of x at the third iteration (x3)? [ 6 marks ]

QUESTION 2

A carpenter makes tables and chairs. Each table can be sold for a profit of RM25 and each chair
for a profit of RM15. The carpenter can only afford to spend up to 40 hours per week working and
takes six hours to make a table and three hours to make a chair. A table takes up 1m2 storage space
as chairs takes up 0.5m2 storage space and there are only 17m2 storage space.
i. Tabulate and generate objective function and limitation inequalities from the problem
above
[7 marks]
ii. Find the vertices/corner coordinates of the feasible region by using Graphical Method
[15 marks]
iii. How many of the tables and chairs should the carpenter makes for him to make the
maximum profit? Use Corner Point Method [3 marks]
DBM3013 ENGINEERING MATHEMATIC 3

QUESTION 1

d. Given linear equation as below :

2x  3 y  z  2
x  2 y  3z  1
3x  y  z  1

Solve the equation if A=LU decomposition is :

2  3 1   1 0 0 2  3 1 
1 2  3   1 1 0  0 7  7 
   2   2 2
3  1  1  3 1 1 0 0 1 
 2 
[ 8 marks ]

e. Given the polynomial equation x 3  3x 2  x  1  0

i. Find x 0 by using False Position Formula [ 4 marks ]


'
ii. Find f x [ 1 marks ]
iii. Approximate root of the equation in the limit 2<x<3. Write the answer
to 3 decimal places [ 7 marks ]

QUESTION 2

A painter has a stock of 250 paint brush, 300 cans of paint and 100 paint roller. He is required to
paint two type of houses. Type A house is required 25 paint brush, 20 cans of paint and 5 paint
roller. Type B house is required 10 paint brush, 20 cans of paint and 10 paint roller. If the profit
of type A house is RM 8 and on type B house is RM 10;

iv. formulate the appropriate linear programming problem [ 5 marks ]


v. find the vertices of feasible set S by using graphical method [ 10 marks ]
vi. find the maximum profit per day to paint type A and type B houses [ 5 marks ]
LIST OF FORMULA
Crout Method l11 0 0  1 u12 u13 
A = l 21 l 22 0  0 1 u 23 

l31 l32 l33  0 0 1 

Doolittle Method 1 0 0 u11 u12 u13 


A = l 21 1 0  0 u 22 u 23 

l31 l32 1  0 0 u 33 

Newton Raphson 1 x1 y1 f ( x)
xo = xn1  xn 
Method y 2  y1 x 2 y2 f ' ( x)

You might also like