HO CHI MINH CITY UNIVERSITY OF TECHNOLOGY Student name: _____________

Faculty of Computer Science & Engineering Student ID: _____________

—————————————————

Revision for ILP session

Course: Mathematical Modeling
Duration: ... minutes Exam Code: 1712
Choose the best answer for each multiple-choice question and fill in the blank needed.

 For any linear integer programming

Question 1.  problems Which ofthe following statements is FALSE?
A all variables are real. B all variables are integer. C some variables are integer.

D all variables are binary.

 Given a linear programming problem in the general form. Which statement below is true?
Question 2.
A Cannot convert to the standard form.

B Can convert to standard form, depending on the specific case.

C Can convert to standard form by removing some variables.

D Can convert to standard form by adding some variables.

 Which of the following constraints

Question 3.  is not linear?  
A 7x − 6y ≤ 45 B 2xy + x ≥ 15 C x + y + 3z = 35 D 2x + 10y ≥ 60
Question 4. To convert a constraint less than or equal to the standard form in the simplex algorithm we must
 
A add a new variable. B subtract a new variable.

C subtract or add a new variable depending on the problem MIN or MAX.

D A and B are true.

Question 5. A firm has 2 projects to implement. Suppose Xi (i = 1, 2) is 1 if project i is implemented, and

0 otherwise. To ensure that 1 of 2 projects is implemented. Which of the following constraints
represents this requirement?
   
A X1 − X2 ≤ 0. B X1 − X2 = 1. C X1 + X2 = 1. D X1 + X2 ≤ 1.

Question 6. When using the simplex method to solve the MAX problem, we find that when all the ratios(λ) in
the row used to select the pivot elements are negative, then
 
A the solution is optimal. B the solution is unbounded.
 
C the solution is degenerate D the solution is infeasible

Question 7. The constraint

3q X
X 3p
xijk = 1, ∀k = 1 : n; p, q = 1 : 3
3q−2 3p−2

 represents which condition in the Sudoku problem? 

A Numbers 1 to 9 appear exactly once on each line. B No conditions at all.

C The numbers 1 to 9 appear exactly once on each 3x3 square.

D all answers are wrong.

 If a linear program has an optimal solution, then

Question 8.
A the feasible set is non-empty and the objective function is bounded.
 
B the objective function might not be bounded. C the feasible set can be empty.

D only feasible set is non-empty.

 In a linear program, which one of the following statements is true?

Question 9.
A Bounded feasible regions have both a minimum and a maximum value.

B Unbounded feasible regions have either a minimum or maximum value, never both.

C The minimum or maximum value of such objective functions always occurs at the vertex of the feasible region.

D all statements are true.

Exam Code: 1712

Page 1
  A basic feasible solution ofa linear program consists of
Question 10.
A all variables of zero. B basic variables of zero, non-basic variables of non-zero.

C basic variable of non-negative value, non-basic variables of zero.

D basic variables of zero, non-basic variables of positive value.

 If a linear program has an optimal solution, then the solution

Question 11.
A is a point of the interior of the feasible set.

B is an interior point of the boundary of the feasible set.
 
C does not belong to the feasible set. D is an extreme point of the feasible set.

Question 12. In the simplex method, the reduced cost of the objective function rN = cTN − cTB B −1 N is used to
 
A find a basic solution B give a conclusion about whether the feasible region is empty or not

C check the optimal condition at the basic feasible solution

D calculate an extreme point of the feasible region.

 In the simplex method, the

Question 13. reduced costs of the objective
 function at the basic variables are
A less than 0. B greater than 0. C equal to 0.

D greater than or equal to 0.

Question 14. For any linear programming problem,

I) If a linear programming problem has a solution at all, it will have a solution at some corner of
the feasible region.
II) No point other than a corner of the feasible region can be a solution to an LP problem.
III) No point in the interior of the feasible region can be a solution to an LP problem.
Which of the above statements is/are TRUE?
   
A Only I. B I and II. C I and III. D I,II and III.

Question 15. For any linear programming problem,

I) Constraints can always be turned into equations by adding slack variables to the left-hand sides.
II) Constraints can always be turned into equations by subtracting surplus variables from the left-
hand sides.
III) Constraints can always be turned into equations by adding or subtracting slack or surplus
variables from the left-hand sides as appropriate.
Which of the above statements is/are TRUE?
   
A Only I. B I and II. C I,II and III. D Only III.

Question 16. Loan has 15 acres of arable land. She wants to grow wheat or corn on this land. The land can give
a profit of 80 million VND/acre of wheat and 50 million VND/acre of corn. The labor and fertilizer
used for each sample are listed in the table below
wheat corn
Labor 3 2
Fertilizer 3 quintals 10 quintals
Currently, there are 100 quintals of fertilizer available on the land and 30 workers are employed.
Consider X and Y as the number of wheat and corn samples, respectively (assuming we only consider
X, Y ∈ N ). Then the possible value of X is
   
A 10 B 15 C 11 D 16

Question 17. Consider a linear program finding minimum which has the initial simplex tableau as below.
1 1 1 0 0
x1 x2 x3 x4 x5 Rhs
-1 1 2 0 0 2
1 0 -1 0 1 3
2 0 1 1 0 4
r1 r2 r3 r4 r5 -2
Suppose that x2 , x5 , x4 are basic variables. Then, the value of reduced cost ri , for i = 1, 2, 3, 4, 5
 should be   
A (−2, 0, 1, 0, 0) B (0, 2, 1, 0, 0) C (0, 1, 2, 0, 0) D (2, 0, −1, 0, 0)

Exam Code: 1712

Page 2
Question 18. Let the linear programming
min x1 + x3 − x4
xi

x1 − x3 = 1
x3 + x4 = 6
x2 − 2x3 = 3

xi ≥ 0, where i = 1, 2, 3, 4
then, the point (1, 3, 0, 6)

A is a basic feasible solution but not an optimal solution.

B is an optimal solution.

C is not a basic feasible solution.

D is not in the feasible set.
Question 19. Consider a general linear program
min −2x1 + 3x2
x1 ,x2

3x1 + 4x2 ≤ 24,

7x1 − 4x2 ≤ 16,
x1 , x2 ≥ 0.

 Which one of followings can change the problem into standard form?
A 3x + 4x2 + x3 = 24; 7x1 − 4x2 + x4 = 16, với x3 , x4 ≤ 0.
 1
B 3x1 + 4x2 − x3 = 24; 7x1 − 4x2 − x4 = 16, với x3 , x4 ≥ 0.

C 3x1 + 4x2 + x3 = 24; 7x1 − 4x2 + x4 = 16, với x3 , x4 ≥ 0.

D −3x1 − 4x2 + x3 = 24; −7x1 + 4x2 + x4 = 16, với x3 , x4 ≤ 0.

Question 20. Consider the following linear program

min 2x1 − 3x2 + 2x3 − 2x4

xi

subject to
5x1 + 2x3 − 6x4 = 5,
3x2 − x3 + 2x4 = 5,

xi ≥ 0, where i = 1, 2, 3, 4

 Given non-basic variables x2 and x4 , then the corresponding

 basic solution of the problem is
A (3, 0, −5, 0), and also feasible. B (3, 0, −5, 0), and not feasible.
 
C (0, 3, 0, −5), and also feasible. D (0, 3, 0, −5), and not feasible.

Question 21. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x4 , x5 } as below.
1 1 1 0 0
x1 x2 x3 x4 x5 Rhs
-1 1 2 0 0 2
1 0 -1 0 1 3
2 0 1 1 0 4
2 0 -1 0 0 -f(x)

 The new basic variables should

 be  
A {x2 , x5 , x4 }. B {x3 , x5 , x4 }. C {x2 , x3 , x4 }. D {x2 , x5 , x3 }.

Exam Code: 1712

Page 3
Question 22. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x5 , x4 } as below.
-2 3 0 0
x1 x2 x3 x4 Rhs
3 4 1 0 24
7 -4 0 1 16
-2 3 0 0 0

Then, the pivot element (phần tử trục/xoay)


A can not be determined.

B a11 = 3, with in-variable x1 and out-variable x3 .

C a21 = 7, with in-variable x1 and out-variable x4 .

D a12 = 4, with in-variable x2 and out-variable x3 .

Question 23. Consider a linear programming

min x − y
xi

4x − 3y ≤ 0
x + y ≤ 10
x, y ≥ 0

 The feasible region is 

A empty B bounded
 
C unbounded D all answers are false

Question 24. Consider a linear program finding minimum which has the simplex tableau for basic variables
{x2 , x4 , x5 } as below.
1 1 1 0 0
x1 x2 x3 x4 x5 Rhs
-1 1 2 0 0 2
1 0 -1 0 1 3
2 0 1 1 0 4
2 0 -1 0 0 -f(x)

 Which one of the following statements is true?

A The optimal condition is not satisfied, continue to create a new tabular with the in-variable x3

B the problem does not have a solution because the objective function is unbounded

C The optimal condition is not satisfied

D The optimal condition is not satisfied, continue to create a new tabular with the out-variable x3

Question 25. An electronics firm decides to launch two models of a tablet, TAB1 and TAB2. The cost of making
each device of type TAB1 is $120 and the cost for TAB2 is $160. The firm recognizes that this is
a risky venture, so it decides to limit the total weekly production costs to $4000. Also, due to a
shortage of skilled labor, the total number of tablets that the firm can produce in a week is at most
30. The profit made on each device is $600 for TAB1 and $700 for TAB2. How should the firm
 arrange production to maximise profit?
A 20 tablets of model TAB1 and 10 of model TAB2.

B 15 tablets of model TAB1 and 15 of model TAB2.

C 20 tablets of model TAB1 and 15 of model TAB2.

D 15 tablets of model TAB1 and 10 of model TAB2.

 The first step in a branch and bound approach to solving integer programming problems is to
Question 26.
A change the objective function coefficients to whole integer numbers.

B graph the problem.

C solve the original problem using LP by allowing continuous noninteger solutions.

D compare the lower bound to any upper bound of your choice.

Exam Code: 1712

Page 4
  In the branch and bound technique, what is the definition of the incumbent?
Question 27.
A The upper bound of the objective function.

B The lower bound of the objective function.

C The best integer solution that we obtain at each step of branching and bounding.

D None of the other choices is correct.

Question 28. When using the branch and bound method in integer programming maximization problem, the
 stopping rule for branching is to continue until
A the objective function is zero.

B the new upper bound is less than or equal to the lower bound or no further branching is
possible.
C the new upper bound exceeds the lower bound.

D the lower bound reaches zero.

Question 29. In the branch and bound method of solving a linear programming problem with integer variables,
if an optimal solution of a linear programming relaxation problem is an integer, then it is

A a feasible solution of the original problem.

B an optimal solution of the original problem.

C an infeasible solution of the original problem.

D a degenerate solution of the original problem.

Question 30. The relaxation in the branch-and-bound approach for solving a linear integer program performs to
 
A assign all variables to zero. B assign all variables to one.
 
C drop all integer variables. D drop integer constraint of variables.

 problem, To minimize c you can instead maximize p = −c.

 For any linear programming
Question 31.
A True. B False.

 For any linear programming

Question 32.  problem, in a basic solution, some of the variables are 0.
A True. B False.

Question 33. In a feasible basic solution, all the variables (with the possible exception of the objective) are
 nonnegative. 
A True. B False.

Question 34. You should always make sure that there are no negative numbers in the rightmost column (with
the possible exception of the objective) before choosing a pivot.
 
A True. B False.

Question 35. When all the variables (with the possible exception of the objective) are nonnegative and all the
numbers in the bottom row are nonnegative (with the possible exception of the rightmost) you are
 done with the simplex method.

A True. B False.

Exam Code: 1712

Page 5