(1) In the linear programming problem, the solution that satisfies all constraint equations and non-negative constraints are called .

(2) In graph theory, a connected graph is called a tree.

(3) If a constraint condition is a < = situation, if it is transformed into a standard form, a needs to be introduced. (4) The optimal criterion for the material dispatching plan is: when all the inspection numbers are , the current plan must be the optimal plan. (5) The most basic element of a graph is and points. (6) Dynamic programming is a theory and method to solve the optimization problem of . (7) The linear programming model has m constraints and n variables, so its dual model has constraints and variables. (8) The number of squares filled with numbers that can be used as the initial dispatch plan of the operation method on the table should be . (Suppose there are m supply places and n demand places in the problem.) (9) The branch and bound method for solving integer programming is essentially an . (10) The minimum tree problem is to find several edges in the network graph, connect all nodes, and is the smallest.