0% found this document useful (0 votes)
2 views

Integer Program Revision

some example about integer program and dynamical system
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
2 views

Integer Program Revision

some example about integer program and dynamical system
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

QUIZ QUESTIONS

HCMUT- OISP Subject: MATHEMATICAL MODELING


Faculty of Computer Science and Engineering
Class: MM 2024- HK 241
Time: 60 minutes
Date: Last two weeks of the semester

Student’s Full Name: Student’s ID:

Score: Examiner: Signature:

QUESTIONS for FINAL QUIZZING of MM 2024

QUIZ 3 - QUIZ 4 have total 13 MCQ, each costs 1.5 points, planned for
Week 16, DECEMBER 9– 15, 2024. QUIZ 3 and 4 make 20% for HW+ AT of the final exam.

Lecturers will randomly check student’s attendance, any student misses one lecture will get -1 mark.

GUIDES: Students should review the lecture slides and related theoretical documents before the weeks doing quizzes.
In MULTIPLE CHOICE QUESTIONS, answer letters must be completely fill in in bold like this ■,

if you cancel out an answer then deselect it by @
@.

NOTATION: These abbreviations might be useful in the exam.

• N, Z, Q, R respectively are the set of natural, integral, rational and real numbers.

• B(p), Bin(n, p) respectively are the Bernoulli and binomial distributions.

Page 1 of ??
MULTIPLE CHOICE QUESTIONS (1.5 mark each) -
DECEMBER - 2024 , time 8:00 pm – 9:00 pm

Question 1.
The CEO of a firm plans to buy new cars and trucks for year 2025 with a total budget of 15 Million USD. Let x1 be the amount of budget
for buying cars, and x2 be the amount of budget for buying trucks.
The two decision variables x1 , x2 satisfy another condition that 4x2 − x1 − 15 ≤ 0. The total number of constraints m and the number of
extreme points K of the model’s feasible region respectively are
       
A m = 5 and K = 5. B m = 4 and K = 4. C m = 4 and K = 3. D m = 3 and K = 2.

Answer to Question 1:
 
B 

Question 2.
The new president of nation V invests 15 Million USD to build new scientific colleges with budget x1 , and new technical schools with
budget x2 during 2025-2028. The budget planing for such colleges and schools satisfies a condition of investment ratio that 4x2 −x1 −15 ≤ 0.

With this investment, the new administration would observe that a profit from building new colleges ZC equals 20% of the spent budget,
and a profit from building new technical schools ZT equals 40% of the spent budget within the next 4 years. The profit objective function
is given by z = ZC + ZT .
The profit function, the optimal solution x = [x1 , x2 ]⊤ and optimal value zOP T respectively are
   
A z = 0.2 x1 + 0.4 x2 , x1 = 9, x2 = 6; zOP T = 4.2. C z = 0.4 x1 + 0.2 x2 , x1 = 11, x2 = 4; zOP T = 3.8.
   
B z = 0.2 x1 + 0.4 x2 , x1 = 5, x2 = 9; zOP T = 4.2. D z = 0.4 x1 + 0.2 x2 , x1 = 9, x2 = 6; ; zOP T = 4.

Answer to Question 2:
 
A 

Page 2 of ??
Question 3. Consider a program with two variables and three specific constraints given as:

x1 + 5x2

 ≤ 80

4x + 2x
1 2 ≥ 20
x 1 + x 2

 ≥ 10

x1 ≥ 0, x2 ≥ 0

The number of slack and surplus variables needed to transform the constraints our LP to the Canonical form is
       
A 5. B 4. C 3. D 2.

Answer to Question 3:
 
C 

Question 4. Consider a LP model with decision variables x = (x1 , x2 , x3 , · · · , xn−1 , xn )⊤ that has a constraint set with m constraints
n
X
aij xj ≤ bi , for i = 1, · · · , m.
j=1
Denote F be the feasible set of this model. Denote xopt be an optimal solution. You conclude that
   
A F is bounded and no constraint is satisfied for xopt . C F is convex and xopt satisfies some of the constraints.
   
B F is unbounded and xopt fulfills all the constraints. D F is convex and xopt fulfills all the constraints.

Answer to Question 4:
 
D 

Question 5. TOM - a fan of hamburger in New York city- goes to a McDonald store to have lunch, with only $34 in his pocket. Given
that each small Mac costs $3, each medium Mac costs $4, and each Big Mac costs $5.
Denote by x1 , x2 , x3 the natural numbers of hamburgers corresponding to small Mac, medium Mac and Big Mac that he might buy. He
wonders, perhaps his plan at least must satisfy that 3x1 + 5x2 + 4x3 ≤ 34; xi ∈ Z, ∀i = 1, 2, 3, but not sure!! Suppose further that TOM
is very hungry on that day, he decides not eating small and medium Mac hamburger, and only likes to eat Big Mac.
The suitable simple constraints and the maximum number K of Big Macs he could order respectively are

Page 3 of ??
 
A 3x1 + 4x2 + 5x3 ≤ 34; xi ∈ Z, ∀i = 1, 2, 3, and K = 5.
 
B 3x1 + 4x2 + 5x3 ≤ 34; xi ∈ N, ∃i ∈ {1, 2, 3} and K = 6.
 
C 3x1 + 4x2 + 5x3 ≤ 34; x1 , x2 , x3 ≥ 0 and K = 6.
 
D 3x1 + 4x2 + 5x3 ≤ 34; xi ∈ N, ∀i ∈ {1, 2, 3} and K = 6.

Answer to Question 5:
 
D 

Question 6.
Consider a Capital Budget Planing in m > 1 phases described by a Binary IP model as follows.

Model BIP : max Z = cT ·x


x
subject to Ax ≤ b
x = (x1 , x2 , x3 , · · · , xn−1 , xn )T ∈ {0, 1}n = V
where the constraint matrix A = [aij ] has size m × n with all entries aij ≥ 0.

We remind few facts of BIP model.


(1) Let F be the feasible solution set of Model BIP. Clearly F ⊂ V = {0, 1}n , the vertex set of the hypercube Hn = (V, E).
n
X
T T
(2) The edge set E = {(u, v) : d(u, v) = 1; with u = (u1 , u2 , · · · , un ) , v = (v1 , v2 , · · · , vn ) ∈ V }, where d(u, v) = |ui − vi | is the
i=1
Hamming distance between two nodes u and v.
n
X
• For any row i = 1, 2, . . . , m, the i-th constraint of Ax ≤ b is said to be ‘valid’ or ‘suitable’ if and only if bi ≥ aij . Otherwise, it
j=1
is said to be ‘invalid’ (not suitable).

• Define set P = {j0 ∈ {1, 2, . . . , n} : ∃ i ∈ {1, 2, . . . , m} : aij0 > bi }. P can be used to reduce the dimension of problem (Model BIP). ■

The total numbers of edges |E| in Hn = (V, E) and the maximum size mF of F respectively are

Page 4 of ??
   
n−|P |
A |E| = n 2 and mF = 2n−1 . C |E| = n 2n−1 and mF = 2n−1 .
   
B |E| = n 2n−1 and mF = 2n−|P | . D |E| = 2n−1 and mF = n 2n−|P | .

Answer to Question 6:
 
B 

Question 7.
A start-up company has a plan to develop business next year with a total budget of 10 Million USD for investments in two sectors: ICT
sector (ICT means Information and Communication Technology), and Manufacturing sector.

Denote by x1 , x2 two variables respectively for the amount of budget [unit of 1 million usd] spent for ICT sector and the amount of budget
spent for Manufacturing sector.

• After 1 year of investment, the return Z1 obtained from ICT is 10% of the planned budget, and the return Z2 obtained from
Manufacturing is 30% of the assigned budget.

• Therefore, your investment planning can be formulated as a linear program with maximizing an objective function z = Z1 + Z2
(providing the return from both sectors after 1 year of investment).

The ICT sector often has higher risk than that of the Manufacturing sector, therefore we further require that −6 ≤ 3x1 − 3x2 . The optimal
solution is x = (x1 , x2 )⊤ and the optimal value zmax respectively are
   
A x = (5, 5)⊤ and zmax = 2.8. C x = (4, 6)⊤ and zmax = 2.2.
   
B x = (6, 4)⊤ and zmax = 2.2. D x = (4, 6)⊤ and zmax = 2.8.

Answer to Question 7:
 
C 

Page 5 of ??
Question 8. In banking sector and financial engineering, a bank is considered ineffective in treating bad debts if its debt amount of
money remains above 100 million dollars per year (US$ 100 M/year). Assume that the initial debt amount at a certain bank in the U.S.,
like CITI bank, currently is US$ 600 M/year. It is known from the bank fiscal data that its debt decays (decreases) at the rate of 18% of
the amount present each year.
Let an be the debt amount of money of that bank after n years; (year n = 0 means 2017, year n = 1 means 2018, etc). The debt amount
of money after the n-th year, and the year when the bank’s ability of treating debt just becomes effective respectively are
   
A an = 0.82 an−1 , a0 = 600, and n = 10. C an = 0.82 an+1 , a0 = 640, and n = 9.
   
B an = 0.80 an−1 , a0 = 640, and n = 10. D an = 0.18 an−1 , a0 = 600, and n = 11.

Answer to Question 8:
 
A 

Question 9. We consider the value of a savings certificate initially worth $1000 that accumulates annual interest
at 12% compounded continuously. Let V (t) represent for the value of the certificate at any time t ∈ [0, +∞).
The formula of V (t) and its values after 8 years respectively are given by
   
t
A V (t) = V (0) (1.12) and V (8) = 2611.7. C V (t) = 1000 e1.12t and V (8) = 2611.7.
 dV  
B  dt
= 0.12V , and V (8) = 2944.6.
D V (t) = V (0) e0.12t and V (8) = 2611.7.

Answer to Question 9:
 
D 

Question 10. This question is motivated by many cultural events annually organized in Canberra, Australia (like the Floriade 2024
flower festival shown in the next picture, with open-air music performance). A car rental service, having distributorships in Sydney and
Canberra, allows travelers booking their itinerary in either city and visiting both cities. Some day a traveler would rent a car in one city
and may either drop the car off in that city or in the second city at the end of the day. Recorded data reveals that from September, 30%
of the cars daily rented in Sydney are returned to Sydney, whereas 70% end up in Canberra. Of the cars daily rented from the Canberra
office, 40% are returned to Canberra, whereas the remaining cars end up in Sydney. Denote by

Page 6 of ??
(
Sn = the number of cars in Sydney at the end of day n,
(1)
Cn = the number of cars in Canberra at the end of day n, n ∈ N.
(
Sn+1 = f (Sn , Cn )
Suppose this discrete dynamical system has the recursive pattern where f, g are two linear bi-variate
Cn+1 = g(Sn , Cn ), n ∈ N
functions. The equilibrium values (S, C) of this system are those values of Sn and Cn for which no change in the system takes place when
(
S = f (S, C)
n changes (n → ∞). The pair (S, C) so satisfies
C = g(S, C).
If the firm owns in total 1300 cars, then no matter how many cars they distributed in Sydney and Canberra on the beginning day of their
business, after several days the number of cars end up in Sydney and Canberra mathematically are equilibrium values (S, C). In Predictive
Modeling, to forecast the stable number of cars for renting the car rental firm should choose the pair of equilibrium values (S, C) as
   
A (S, C) = (700, 600). C (S, C) = (800, 500).
   
B (S, C) = (600, 700). D (S, C) = (650, 650).

Answer to Question 10:


 
B 

Page 7 of ??
Question 11. In the Theory of System of ODEs we remind few concepts as follows.

Nullcline: Curve along which one of the variables is a steady state (first derivative is constant).

Predator Prey (Lotka-Volterra) Equations are given by

dx


 = f (x, y) = (ax − bxy)
 dt

(2)
 dy


= g(x, y) = (−cy + dxy)

dt
in which positive real parameters have meanings

• a: growth rate of prey; b: consumption of x by y

• c: natural mortality of y; and d: consumption of x by y.


dx
Hence, along the x isocline (special nullcline), we have ẋ = = f = 0.
dt
Assume that both x and x are isocline in the Predator Prey model, then you have
  c c a
A two straight lines y = 0, x = , and an equilibrium point Ze = ( , ) in the phase plane.
d d b
  a c a
B three straight lines x = 0, y = 0, y = b , and an unique equilibrium point Ze = ( d , b ) in the phase plane.
  a c c a
C straight lines x = 0, y = b , y = 0, x = d and two equilibrium points (0, 0) and Ze = ( d , b ) in the phase plane.
  c a a c
D straight lines y = 0, x = d , y = b and the unique equilibrium point Ze = ( b , d ) in the phase plane.

Answer to Question 11:


 
C 

Page 8 of ??
Question 12. The following assumption is used for this question and the next question.
,→ In Social Sciences, a social diffusion describes the spreading of a piece of information, a technological innovation, or a cultural fact ...
among a population P . The members of the population P can be divided into two classes: those who have the information and those who
do not have the information. Let X = X(t) denote the number of persons at time t ∈ [t∗ , +∞) who have the information in P , where t∗
is the initial moment we study this social diffusion. Assume that (1) population P has size N > 0,
dX
(2) the spreading of the information is limited by the maximum size N of P ; and that
dt
dX
(3) the rate at which the information spreads decreases as more and more people have known the information. End Assumption ■
dt
Put k be a suitable value, the best model suited to estimate X is
 dX  dX  dX  
A  dt = k X (N − X). B  dt = k X (X − N ). C  dt = k (N + X). D None of the other answers.

Answer to Question 12:


 
A 

C1
Question 13. A logistic (growth) model π(t) is a continuous curve with respect to time t given by equation π(t) = ,
1 + e−C2 Z
where C1 , C2 are two positive constants, and Z = Z(t) is a linear function of t. Assume that P has size N = 5000, and the initial time
t∗ = 3. The number of persons knowing information in P on day t was recorded as follows:
t [days] 2 3 6 10
X(t) [number of persons knowing information on day t] 1887 2500 4087 4853
ln(X/(N − X)) −0.5 0 1.5 3.5
Is X = X(t) a logistic function, its explicit formula and value X(12) [the number of persons having the information in population P on
day 12] respectively are
  5000   5000
A Yes, X(t) =
1 + e−0.5 (t−3)
and X(12) = 4853 persons. C Yes, X(t) =
1 + e−0.5 (t−t∗ )
and X(12) = 4945 persons.

  5000   5000
B Yes, X(t) =
1 + e0.5 (t−t∗ )
and X(12) = 4945 persons. D No, X(t) =
1 + e−0.5 (t−t∗ )
and X(12) = 4945 persons.

Answer to Question 13:


 
C 

Page 9 of ??

You might also like