# Methods of optimization test answers 31 questions.

Affiliates: 0,03 \$ — how to earn
Sold: 0
Refunds: 0

Content: МОР тест.rar (8,56 kB)

# Description

Methods of optimization, test, 31 questions.

1. The main objective of the linear programming (OZLP), refer to the
a) the canonical form,
b) freeform
c) a standard form.

a) - OZLP,
b) - linear programming problem,
c) is not OZLP,
d) - nonlinear problem.

3. The maximum point of the objective function in the area of ​​feasible solutions, shown in the chart -
a) the point (0, 0)
b) The point (0, 2),
c) point (2, 0).

4. A minimum of the objective function, feasible region, and vector gradient is depicted on the chart -

b) (0, 0),
d) (2, 0).

5. The support plan simplex table, considering that
a) is optimal,
b) it is not optimal,
) is not a reference plan.

6. At this stage of the simplex method, the objective function value is equal to

7. The vector gradient of the objective function has the coordinates OZLP
a) {60, -30},
b) {-30; 120}
c) {10, 20}
g) {30 -20}.

8. Coordinates the column vector of free members OZLP
a) {-1, 2, 8},
b) {-1, -2, 8},
c) {1, 2, -4},
g) {1, -3, 3}.

9. Optimum OZLP objective function on the plane can be
a) any point of the polygon solutions
b) the party making the polygon,
c) any point of the polygon corner solutions
d) empty set.

10. The area of ​​feasible solutions OZLP belongs
11. On the problem of linear programming
dual conjugate problem will be solved, the dual
a) has a solution;
b) can not have a solution, as a result of an unlimited increase in the target
function;
c) has no solutions;
d) has a set of solutions.

The problem (TK) is closed if
a) a = 40, b = 30,
b) a = 20, b = 40,
a) a = 40, b = 10,
g) a = 40, b = 20.

14. The criterion for the solvability of TK is
a) the absence of positive ratings in the method of potentials;
b) equality of the total reserves and total requirements;
c) equal number of cells occupied the rank of TK;
g) equality of the number of suppliers to the number of consumers.
Table TK potential method is the cost of transport
a) 600
b) 1500
c) 700;
g) 300.
Initial plans TK
a) potentials,
b) north-west corner,
c) the simplex method,
d) method of a minimum fare.

17. The transportation plan
a) degenerate,
b) non-degenerate.

the price of the game, given the payoff matrix A, is a strategy game, given the payoff matrix A is a vector
a) (3, 1),
b) (2, 4)
c) (1, 4, 9),
g) (3, 2, -1).

Point payoff matrix A has kordinaty
a) (1, 2),
b) (1, 1),
under repeated
the game provides the player with
a) the maximum gain;
b) the average gain;
c) a minimum loss;
d) the maximum possible average gain.
nature, given matrix A, the highest average gain of the random vector X for the game, given graphically
The following figure is
a) X = (1/3, 2/3),
b) X = (2/3, 1/3),
a) X = (1/3, 2),
g) X = (4/3, 1).

The game with nature, given matrix A, the criterion Bayes optimal strategy is
a) A = (30, 80);
b) A = (80, 150);
a) A = (
g) A = (
between the vertices of the graph is equal to 1 and 6
a) contains only non-negative elements;
b) - a square matrix;
c) - symmetric matrix;
g) containing 0, 1, -1.

for the graph shown in the figure,
a) 1-2-5-2-3-4-5-6-1;
b) 1-2-3-4-5-6-1;
c) 1-2-3-4-5-6;
d) 1-2-5-6-1-2-5-4-3-2-1.

path network graph shown in the following figure,
a) 1-3-5-6-7;
g) 1-3-5
b) 1-2-4-7;
d) 1-3-6;
a) 1-2-4;
e) 1-3-6-7.

This table settings of network schedule work full time reserve (2, 4) is the way to show the problem of network planning
a) lack of reserves of time;
b) the minimum duration of the project;
c) the maximum execution time of the project;
d) the sequence of critical works.

31. In the table settings of network schedule, which consists of 6 works,
a critical time of the project is equal to
Переводчик Google для бизнеса –Инструменты переводчикаПереводчик сайтовСлужба "Анализ рынков"