Operations research and optimization methods (answers)
Content: ответы.zip (35.43 KB)
Uploaded: 10.02.2020
Positive responses: 0
Negative responses: 0
Sold: 9
Refunds: 0
$1.43
Operations research and optimization methods (answers to Synergy tests)
Result: 96 points
If random values are contained in the objective function or in the functions defining the range of possible changes of variables, then such a problem relates to problems ... of programming
linear fractional
dynamic
stochastic
parametric
If, according to the theorem, the set of plans P of the linear programming problem is a closed convex set, then this set P ...
can be either limited or unlimited, in addition, it can be empty
always limited
always unlimited
can be either limited or unlimited, but cannot be empty
Any specific choice of parameters for conducting an operation within the discipline "Operational Research" is called ...
decision
the consequence
proof
conclusion
Studying the effect of changing model parameters on the resulting optimal solution to a linear programming problem is called ...
sensitivity analysis
conditional optimization
order decision
analysis with conditional source data
variant analysis
Decision analysis, or sensitivity analysis, is a process being implemented ...
before and after obtaining the optimal solution to the problem
in the process of obtaining the optimal solution
after the optimal solution to the problem is obtained
before the optimal solution to the problem was obtained
It is not true that the types of analysis performed on the basis of a mathematical model (after obtaining the optimal solution) include ...
decision analysis
sustainability analysis
limit analysis
variative analysis
The main objective of operations research is ...
preliminary selection of optimal solutions
qualitative substantiation of optimal solutions
finding all possible solutions and highlighting those of them that for one reason or another are preferable to others
preliminary quantification of optimal solutions
A task, the process of finding a solution to which is multi-stage, relates to tasks ... programming
linear fractional
dynamic
stochastic
parametric
The dynamic programming process ...
usually unfolds from beginning to end, i.e. First of all, the first step is planned - the only one that can be planned so that it brings the greatest benefit
usually unfolds from end to beginning, i.e. first of all, the last step is planned - the only one that can be planned so that it brings the greatest benefit
can unfold from beginning to end, and from end to beginning, depending on the conditions of the task
The goal ... of the Hungarian algorithm is to obtain the maximum possible number of zero elements in the cost matrix
the third step (modification of the reduced matrix)
second step (definition of appointments)
first step (row and column reduction)
Establish a general sequence of steps through which any operational research goes:
Answer Type: Sort
1 constructing a meaningful (verbal) model
2 decision analysis
3 analysis of the model and obtaining a solution to the problem
4 statement of the problem
5 verification of the results obtained on their adequacy to the nature of the studied system
6 building a mathematical model
As a result of solving quadratic programming problems, it is generally necessary to find the maximum (or minimum) of the quadratic function, provided that its variables satisfy a certain system ...
only linear inequalities
nonlinear equations only
linear inequalities or linear equations, or some system containing both linear inequalities and linear equations
Using the graphical method, it is advisable to solve linear programming problems containing no more than ...
three variables
two variables
single variable
four variables
In the literature, dual variables are usually called dual estimates, or ... prices
normalized
conditional
shadow
estimated
Result: 96 points
If random values are contained in the objective function or in the functions defining the range of possible changes of variables, then such a problem relates to problems ... of programming
linear fractional
dynamic
stochastic
parametric
If, according to the theorem, the set of plans P of the linear programming problem is a closed convex set, then this set P ...
can be either limited or unlimited, in addition, it can be empty
always limited
always unlimited
can be either limited or unlimited, but cannot be empty
Any specific choice of parameters for conducting an operation within the discipline "Operational Research" is called ...
decision
the consequence
proof
conclusion
Studying the effect of changing model parameters on the resulting optimal solution to a linear programming problem is called ...
sensitivity analysis
conditional optimization
order decision
analysis with conditional source data
variant analysis
Decision analysis, or sensitivity analysis, is a process being implemented ...
before and after obtaining the optimal solution to the problem
in the process of obtaining the optimal solution
after the optimal solution to the problem is obtained
before the optimal solution to the problem was obtained
It is not true that the types of analysis performed on the basis of a mathematical model (after obtaining the optimal solution) include ...
decision analysis
sustainability analysis
limit analysis
variative analysis
The main objective of operations research is ...
preliminary selection of optimal solutions
qualitative substantiation of optimal solutions
finding all possible solutions and highlighting those of them that for one reason or another are preferable to others
preliminary quantification of optimal solutions
A task, the process of finding a solution to which is multi-stage, relates to tasks ... programming
linear fractional
dynamic
stochastic
parametric
The dynamic programming process ...
usually unfolds from beginning to end, i.e. First of all, the first step is planned - the only one that can be planned so that it brings the greatest benefit
usually unfolds from end to beginning, i.e. first of all, the last step is planned - the only one that can be planned so that it brings the greatest benefit
can unfold from beginning to end, and from end to beginning, depending on the conditions of the task
The goal ... of the Hungarian algorithm is to obtain the maximum possible number of zero elements in the cost matrix
the third step (modification of the reduced matrix)
second step (definition of appointments)
first step (row and column reduction)
Establish a general sequence of steps through which any operational research goes:
Answer Type: Sort
1 constructing a meaningful (verbal) model
2 decision analysis
3 analysis of the model and obtaining a solution to the problem
4 statement of the problem
5 verification of the results obtained on their adequacy to the nature of the studied system
6 building a mathematical model
As a result of solving quadratic programming problems, it is generally necessary to find the maximum (or minimum) of the quadratic function, provided that its variables satisfy a certain system ...
only linear inequalities
nonlinear equations only
linear inequalities or linear equations, or some system containing both linear inequalities and linear equations
Using the graphical method, it is advisable to solve linear programming problems containing no more than ...
three variables
two variables
single variable
four variables
In the literature, dual variables are usually called dual estimates, or ... prices
normalized
conditional
shadow
estimated
... is the field of mathematics that develops the theory and numerical methods for solving multidimensional extremal problems with restrictions, i.e. problems on the extremum of the function of many variables with restrictions on the domain of change of these variables
Problems, the solution of which determines the minimum of a convex (or maximum concave) function defined on a convex closed set, are tasks ... of programming
parametric
convex
linear fractional
linear
integer
In the canonical linear programming problem ...
variables can be either negative or positive
objective function to be minimized
all functional constraints are written in the form of equalities with a non-negative right-hand side
all variables are non-negative
objective function to be maximized
According to the corollaries of the extreme point theorem, ...
the extreme point of the set P can have at most m strictly positive components
if множество is bounded, then it is a convex polyhedron
the number of extreme points of the set P is infinite
An analysis to answer the question: “What will happen if ...?” Is called ...
variant analysis
custom solutions
limit analysis
sustainability analysis
... a task is an auxiliary linear programming problem, formulated with the help of certain rules directly from the conditions of the original, or direct, task, which is applicable to any form of representing the direct problem
In linear-fractional programming problems, the objective function is the ratio of two linear functions, and the functions that determine the range of possible changes in variables are ...
also linear
on the contrary, are nonlinear
can be both linear and non-linear
The shadow price in Excel reports is a dual variable that shows the change in the objective function when the inventory of the resource changes by one, and if the resource is fully used, the shadow price of this resource ...
will remain unchanged
positive
negative
The economic and mathematical model is ...
set of mathematical functions used in economics
tables with a set of calculated parameters used in the analysis of economic processes
any of the abstract models. relating to economic objects., processes
Problems, the solution of which determines the minimum of a convex (or maximum concave) function defined on a convex closed set, are tasks ... of programming
parametric
convex
linear fractional
linear
integer
In the canonical linear programming problem ...
variables can be either negative or positive
objective function to be minimized
all functional constraints are written in the form of equalities with a non-negative right-hand side
all variables are non-negative
objective function to be maximized
According to the corollaries of the extreme point theorem, ...
the extreme point of the set P can have at most m strictly positive components
if множество is bounded, then it is a convex polyhedron
the number of extreme points of the set P is infinite
An analysis to answer the question: “What will happen if ...?” Is called ...
variant analysis
custom solutions
limit analysis
sustainability analysis
... a task is an auxiliary linear programming problem, formulated with the help of certain rules directly from the conditions of the original, or direct, task, which is applicable to any form of representing the direct problem
In linear-fractional programming problems, the objective function is the ratio of two linear functions, and the functions that determine the range of possible changes in variables are ...
also linear
on the contrary, are nonlinear
can be both linear and non-linear
The shadow price in Excel reports is a dual variable that shows the change in the objective function when the inventory of the resource changes by one, and if the resource is fully used, the shadow price of this resource ...
will remain unchanged
positive
negative
The economic and mathematical model is ...
set of mathematical functions used in economics
tables with a set of calculated parameters used in the analysis of economic processes
any of the abstract models. relating to economic objects., processes
No feedback yet