Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be ...Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.展开更多
The slope of indifference curve is known as a marginal rate of substitution （MRS）. MRS defining ratio always describes slope of indifferent curve, i.e. MRS matches the module of indifferent curves slope. Utility fun...The slope of indifference curve is known as a marginal rate of substitution （MRS）. MRS defining ratio always describes slope of indifferent curve, i.e. MRS matches the module of indifferent curves slope. Utility function U（Xl,X2） is used to calculate marginal rate of substitution （MRS）, because MRS gives the slope of appropriate indifference curve, it can be interpreted as a norm, in which costumer is ready to substitute good 1 by small amount of good 2. The word ＂marginal＂ in economic means ＂differential＂. Here we have partial differentiation, because in time of calculation of good l＇s marginal utility the amount of good 2 remains the same. We can calculate MRS in two ways using differential and function. In the first case consider change （akl,ak2） during which utility is unchanged. For the second method let the curve of indifference present by x2 （X1） function. The function shows how many of x2 is needed for each unit of xl to stay on this concrete curve of indifference. We obtain two equations for the term of MRS and budget constraint and two xl and x2 variables. To define the optimal choice of x1 and x2 as a function of the price and income, we need to solve those two equations. The problem of maximization can be solved by using differential.展开更多
The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and ap...The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.展开更多
In a 2^(k)-factorial experiment with limited resources,when practitioners can identify the nonnegligible effects and interactions beforehand,it is common to run an experiment with a saturated design that ensures the u...In a 2^(k)-factorial experiment with limited resources,when practitioners can identify the nonnegligible effects and interactions beforehand,it is common to run an experiment with a saturated design that ensures the unbiased estimation of the non-negligible parameters of interest.We propose a method for the construction of D-optimal saturated designs for the mean,the main effects,and the second-order interactions of one factor with the remaining factors.In the process,we show the problem is just as hard as the Hadamard determinant problem.展开更多
文摘Solving the absent assignment problem of the shortest time limit in a weighted bipartite graph with the minimal weighted k-matching algorithm is unsuitable for situations in which large numbers of problems need to be addressed by large numbers of parties. This paper simplifies the algorithm of searching for the even alternating path that contains a maximal element using the minimal weighted k-matching theorem and intercept graph. A program for solving the maximal efficiency assignment problem was compiled. As a case study, the program was used to solve the assignment problem of water piping repair in the case of a large number of companies and broken pipes, and the validity of the program was verified.
文摘The slope of indifference curve is known as a marginal rate of substitution （MRS）. MRS defining ratio always describes slope of indifferent curve, i.e. MRS matches the module of indifferent curves slope. Utility function U（Xl,X2） is used to calculate marginal rate of substitution （MRS）, because MRS gives the slope of appropriate indifference curve, it can be interpreted as a norm, in which costumer is ready to substitute good 1 by small amount of good 2. The word ＂marginal＂ in economic means ＂differential＂. Here we have partial differentiation, because in time of calculation of good l＇s marginal utility the amount of good 2 remains the same. We can calculate MRS in two ways using differential and function. In the first case consider change （akl,ak2） during which utility is unchanged. For the second method let the curve of indifference present by x2 （X1） function. The function shows how many of x2 is needed for each unit of xl to stay on this concrete curve of indifference. We obtain two equations for the term of MRS and budget constraint and two xl and x2 variables. To define the optimal choice of x1 and x2 as a function of the price and income, we need to solve those two equations. The problem of maximization can be solved by using differential.
文摘The maximal matching problem （MMP） is to find maximal edge subsets in a given undirected graph, that no pair of edges are adjacent in the subsets. It is a vitally important NP-complete problem in graph theory and applied mathematics, having numerous real life applications in optimal combination and linear programming fields. It can be difficultly solved by the electronic computer in exponential level time. Meanwhile in previous studies deoxyribonucleic acid （DNA） molecular operations usually were used to solve NP-complete continuous path search problems, e.g. HPP, traveling salesman problem, rarely for NP-hard problems with discrete vertices or edges solutions, such as the minimum vertex cover problem, graph coloring problem and so on. In this paper, we present a DNA algorithm for solving the MMP with DNA molecular operations. For an undirected graph with n vertices and m edges, we reasonably design fixed length DNA strands representing vertices and edges of the graph, take appropriate steps and get the solutions of the MMP in proper length range using O（n^3） time. We extend the application of DNA molecular operations and simultaneously simplify the complexity of the computation.
基金partially supported by the US National Science Foundation(NSF)[grant number 1809681].
文摘In a 2^(k)-factorial experiment with limited resources,when practitioners can identify the nonnegligible effects and interactions beforehand,it is common to run an experiment with a saturated design that ensures the unbiased estimation of the non-negligible parameters of interest.We propose a method for the construction of D-optimal saturated designs for the mean,the main effects,and the second-order interactions of one factor with the remaining factors.In the process,we show the problem is just as hard as the Hadamard determinant problem.
