7. Arrange in the correct sequence
| 1.Solution | ) set of all feasible solutions. |
| 2.Feasible Solution | b) solution for which all constraints are satisfied. |
| 3.Feasible Region | c) any specification of values for the decision variables. |
Correct answer:1-c) 2-b) 3-a)
8. Simplex method is applied to tasks that are recorded in the form of ___________
| (in the form of answers write the correct answer in one word) |
Correct answer: Standard
9. An indication of basic solution is the lack of negative elements in the column of free terms and zeros in the base column
| yes | |
| no |
Correct answer: yes
10. In zhordano`s table in the Z-row the coefficients of the objective function for the modified zhordano`s seizures record mark of ________________
| (in the form of answers write the correct answer in one word) |
Correct answer: opposite
11. An indication of basic solution are:
| lack of negative elements in the column of free terms zhordano`s table and expression through non-basic variables basis | |
| lack of positive elements in the column of free terms | |
| no zeros in the base column | |
| presence of zeros in the base column |
Correct answer: 1.
12. Simplex method makes it possible to solve the problem, written in the form:
| general | |
| symmetrical | |
| standard |
Correct answer: standard
13. asic solution called linear programming problem:
| plan that are vertex coordinates plans polyhedron problem | |
| plan in which the objective function takes the extreme value |
Correct answer: 1.
14. The first step to finding basic solution is to record the problem in the form of zhordano`s tables
| yes | |
| no |
Correct answer: 1.
15. If zhordano`s table columns in column of free terms are negative elements, those equations system
| multiplied by (-1) | |
| multiplied by 1 | |
| divided by (-1) | |
| divide by 1 |
Correct answer: 1.
16. If the coordinates of the vertex polyhedron plans problem is x = x=(x1; x2; ;xn), the plan called ________________
| (in the form of answers write the correct answer in one word) |
Correct answer: basic
17. Bust support program means moving from one vertex polyhedron plans task to another in the top x *, where the objective function is
| A value of zero | |
| negative values | |
| extreme values |
Correct answer: 3
18. There are ____ stages of solution of linear programming simplex method
| (in the form of answers write the correct answer) |
Correct answer: three
19. If you have a basic plan, which plan the next stage solution?
| (in the form of answers write the correct answer in one word) |
Correct answer: basic
|
|
|
20. Minimum positive attitude free membership to the corresponding positive elements Solving column called
| (in the form of answers write the correct answer) |
