MMA Mathematical Research Methods
Replenishment date: 06.07.2023
Content: Answers-MMA-Mathematical Methods of Operations Research.pdf (283.12 KB)
️Automatic issue of goods ✔️
️Automatic issue of goods ✔️
Sales:
0
Refunds:
0
Reviews:
0
Views:
61
Description
Question 1
In a mathematical programming problem, this type
f(x_1,x_2, …, x_n)→max
there is a
a. restrictions
b. coefficient vectors
c. objective function
Question 2
Which of the following is not true of mathematical programming problems?
a. linear programming
b. regression analysis
c. non-linear programming
Question 3
The factory produces two types of products: P_1 and P_2. For the production of these products, three initial products are used - A, B, C. The maximum possible daily reserves of these products are 12, 11 and 9 tons, respectively. The costs of raw materials A, B, C per 1 thousand products P_1 and P_2 are shown in the table.
Initial product Consumption of initial products per 1 thousand items (t) Maximum possible stock (t)
P_1 P_2
A 2 4 12
B 3 5 11
S 4 7 9
The daily demand for products P_1 never exceeds the demand for products P_2 by more than 2 thousand pieces. In addition, it has been established that the demand for products P_1 never exceeds 3 thousand pieces. per day.
Wholesale prices 1 thousand pieces. products P_1 are equal to 2,7 thousand rubles, 1 thousand pieces. P_2 - 2,9 thousand rubles.
X_1 - daily production volume of the product П_1в thousand pieces; X_2 - daily production volume of item P_2 in thousand pieces.
Indicate the correct form of the objective function that maximizes the value of the total income.
a. f(X ̅) = 2,7X_1+2,9X_2, X ̅ =(X_1, X_2)
b. (X ̅) = 2,9X_1+2,7X_2, X ̅ =(X_1, X_2)
c. (X ̅) = 3X_1+2X_2, X ̅ =(X_1, X_2)
Question 4
For the task from question 3, indicate the limit for the consumption of product A
a. 2X_1 + 4X_2 ≤ 12
b. 2X_1 + 2X_2 ≤ 12
c. 4X_1 + 4X_2 ≤ 12
Question 5
For the problem from Question 3, the Constraints on the amount of demand for products have the form
a. X_1 - X_2 ≤ 2 , X_1 ≤ 3
b. X_2 - X_1 ≤ 2 , X_1 ≤ 3
c. X_1 - X_2 ≤ 2 , X_2 ≤ 3
In a mathematical programming problem, this type
f(x_1,x_2, …, x_n)→max
there is a
a. restrictions
b. coefficient vectors
c. objective function
Question 2
Which of the following is not true of mathematical programming problems?
a. linear programming
b. regression analysis
c. non-linear programming
Question 3
The factory produces two types of products: P_1 and P_2. For the production of these products, three initial products are used - A, B, C. The maximum possible daily reserves of these products are 12, 11 and 9 tons, respectively. The costs of raw materials A, B, C per 1 thousand products P_1 and P_2 are shown in the table.
Initial product Consumption of initial products per 1 thousand items (t) Maximum possible stock (t)
P_1 P_2
A 2 4 12
B 3 5 11
S 4 7 9
The daily demand for products P_1 never exceeds the demand for products P_2 by more than 2 thousand pieces. In addition, it has been established that the demand for products P_1 never exceeds 3 thousand pieces. per day.
Wholesale prices 1 thousand pieces. products P_1 are equal to 2,7 thousand rubles, 1 thousand pieces. P_2 - 2,9 thousand rubles.
X_1 - daily production volume of the product П_1в thousand pieces; X_2 - daily production volume of item P_2 in thousand pieces.
Indicate the correct form of the objective function that maximizes the value of the total income.
a. f(X ̅) = 2,7X_1+2,9X_2, X ̅ =(X_1, X_2)
b. (X ̅) = 2,9X_1+2,7X_2, X ̅ =(X_1, X_2)
c. (X ̅) = 3X_1+2X_2, X ̅ =(X_1, X_2)
Question 4
For the task from question 3, indicate the limit for the consumption of product A
a. 2X_1 + 4X_2 ≤ 12
b. 2X_1 + 2X_2 ≤ 12
c. 4X_1 + 4X_2 ≤ 12
Question 5
For the problem from Question 3, the Constraints on the amount of demand for products have the form
a. X_1 - X_2 ≤ 2 , X_1 ≤ 3
b. X_2 - X_1 ≤ 2 , X_1 ≤ 3
c. X_1 - X_2 ≤ 2 , X_2 ≤ 3
Additional Information
Question 6If the objective function or the functions that determine the area of possible changes in variables contain random variables, then such a problem belongs to the problem
a. regression programming
b. dynamic programming
c. stochastic programming
Question 7
In which tasks is the objective function a ratio of two linear functions, and the functions that determine the area of possible changes in variables are also linear.
a. fractional linear programming
b. regression programming
c. parametric programming
Question 8
In what tasks is the objective function or functions that determine the area of possible changes in variables, or both, depend on some parameters
a. regression programming
b. parametric programming
c. fractional linear programming
Question 9
In what problems can unknowns take only integer values.
a. regression programming
b. parametric programming
c. integer programming
Question 10
How many stages, as a rule, any operational research has
at. 7
b. 4
c. 3
Question 11
What is a simplified representation of a real object called?
a. model
b. original
c. prototype
Question 12
The process of building models is called:
a. experimentation
b. construction
c. modeling
Question 13
An information model consisting of rows and columns is called:
a. table
b. schedule
c. scheme
Question 14
What is the general name of models, which are a collection of useful and necessary information about an object?
a. informational
b. material
c. verbal
Question 15
The electrical circuit diagram is:
a. tabular information model
b. hierarchical information model
c. graphic information model
Question 16
The iconic model is:
a. map
b. Kids toys
c. building layout
Question 17
Indicate the purpose of modeling in the simulation of the process of studying the temperature regime of the room:
a. room temperature study
b. room
c. air convection in the room
Question 18
The correct definitions of the concepts are given in the paragraphs:
1) modeled parameter - features and properties of the object - the original, which the model must necessarily have;
2) a simulated object - an object or a group of objects, the structure or behavior of which is studied using modeling;
3) law - the behavior of the modeled object.
a. 1
b. 2 - 3
w. 1 – 3
Question 19
The tool for computer simulation is:
a. monitor
b. scanner
c. computer
Question 20
What is the name of the tool for visual representation of the composition and structure of the system?
a. graph
b. text
c. table
References
Question 1
In a mathematical programming problem, this type
f(x_1,x_2, …, x_n)→max
there is a
a. restrictions
b. coefficient vectors
c. objective function
Question 2
Which of the following is not true of mathematical programming problems?
a. linear programming
b. regression analysis
c. non-linear programming
Question 3
The factory produces two types of products: P_1 and P_2. For the production of these products, three initial products are used - A, B, C. The maximum possible daily reserves of these products are 12, 11 and 9 tons, respectively. The costs of raw materials A, B, C per 1 thousand products P_1 and P_2 are shown in the table.
Initial product Consumption of initial products per 1 thousand items (t) Maximum possible stock (t)
P_1 P_2
A 2 4 12
B 3 5 11
S 4 7 9
The daily demand for products P_1 never exceeds the demand for products P_2 by more than 2 thousand pieces. In addition, it has been established that the demand for products P_1 never exceeds 3 thousand pieces. per day.
Wholesale prices 1 thousand pieces. products P_1 are equal to 2,7 thousand rubles, 1 thousand pieces. P_2 - 2,9 thousand rubles.
X_1 - daily production volume of the product П_1в thousand pieces; X_2 - daily production volume of item P_2 in thousand pieces.
Specify rights