The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which e...The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which ensure the existence of at least three positive solutions of the boundary value problem are established.展开更多
Based on recent research developments in multi-objective solid transportation problem (MOSTP), this paper presents a fuzzy programming approach to determine the optimal compromise solution of MOSTP. The characteristic...Based on recent research developments in multi-objective solid transportation problem (MOSTP), this paper presents a fuzzy programming approach to determine the optimal compromise solution of MOSTP. The characteristic feature of the proposed approach is that various objectives are synthetically considered with marginal evaluation for individual objectives and global evaluation for all objectives. The decision-maker's preference is taken into account by his/her assigning weights to the objectives. With global evaluation for all objectives, a compromise programming model is formulated. As a generic aggregation operator is adopted, several solution methods proposed earlier become special cases of this approach, and the solution process also becomes more flexible and realistic. An illustrative numerical example is provided to demonstrate the approach.展开更多
By using fixed point theorems,we consider multiplicity of positive solutions for second-order generalized Sturm-Liouville boundary value problem,where the first order derivative is involved in the nonlinear term expli...By using fixed point theorems,we consider multiplicity of positive solutions for second-order generalized Sturm-Liouville boundary value problem,where the first order derivative is involved in the nonlinear term explicitly.We show the existence of multiple positive solutions for the problems.Example is given to illustrate the main results of the article.展开更多
In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estima...In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.展开更多
Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem d...Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.展开更多
In this paper, we consider the existence of multiple positive solutions of discrete boundary value problem. The theory of fixed point index is used here to derive the existence theorem.
The existence of n positive solutions is studied for a class of fourth-order elastic beam equations where one end is fixed and other end is movable. Here, n is an arbitrary natural number. Our results show that the cl...The existence of n positive solutions is studied for a class of fourth-order elastic beam equations where one end is fixed and other end is movable. Here, n is an arbitrary natural number. Our results show that the class of equations may have n positive solutions provided the “heights” of the nonlinear term are appropriate on some bounded sets.展开更多
Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to sol...Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to solve a classical transportation problem, namely the Hitchcock’s Transportation Problem (HTP), and the GA is improved to search for all optimal solutions and identify them automatically. The algorithm is coded with C++ and validated by numerical examples. The computational results show that the algorithm is efficient for solving the Hitchcock’s transportation problem.展开更多
It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 progra...It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.展开更多
We introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of the nonlinear eigenvalue problem into a series of solutions of the corresponding linear ...We introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of the nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and nonlinear eigenvalue problems on the coarsest finite element space. The linearized boundary value problems are solved by some multigrid iterations.Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as the linear problem solver. We prove that the computational work of this new scheme is truly optimal,the same as solving the linear corresponding boundary value problem. In this case, this type of iteration scheme certainly improves the overfull efficiency of solving nonlinear eigenvalue problems. Some numerical experiments are presented to validate the efficiency of the new method.展开更多
For the Poisson equation with Robin boundary conditions,by using a few techniques such as orthogonal expansion(M-type),separation of the main part and the finite element projection,we prove for the first time that the...For the Poisson equation with Robin boundary conditions,by using a few techniques such as orthogonal expansion(M-type),separation of the main part and the finite element projection,we prove for the first time that the asymptotic error expansions of bilinear finite element have the accuracy of O(h3)for u∈H3.Based on the obtained asymptotic error expansions for linear finite elements,extrapolation cascadic multigrid method(EXCMG)can be used to solve Robin problems effectively.Furthermore,by virtue of Richardson not only the accuracy of the approximation is improved,but also a posteriori error estimation is obtained.Finally,some numerical experiments that confirm the theoretical analysis are presented.展开更多
This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal mono...This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal monomial interpolation basis under lexieographie order and the algorithm is in fact a generalization of lex game algorithm. In practice, people usually desire the lowest degree interpolation polynomial, so the interpolation problems need to be solved under, for example, graded monomial order instead of lexicographie order. However, there barely exist fast algorithms for the non- lexicographic order problem. Hence, the authors in addition provide a criterion to determine whether an n-variable Birkhoff interpolation problem has unique minimal monomial basis, which means it owns the same minimal monomial basis w.r.t, arbitrary monomial order. Thus, for problems in this case, the authors can easily get the minimal monomial basis with little computation cost w.r.t, arbitrary monomial order by using our fast B-Lex algorithm.展开更多
This paper considers the stochastic linear quadratic regulation （LQR） problem for Ito stochastic systems with multiple input controllers. The explicit controllers are given in terms of two Riccati equations by intro...This paper considers the stochastic linear quadratic regulation （LQR） problem for Ito stochastic systems with multiple input controllers. The explicit controllers are given in terms of two Riccati equations by introducing one new costate and establishing the homogeneous relationship be- tween the state and the new costate. More importantly, it is more computation saving for the derived Riccati equations than the one derived by augmentation technique.展开更多
文摘The existence of multiple positive solutions for a class of higher order p Laplacian boundary value problem is studied. By means of the Leggett Williams fixed point theorem in cones, existence criteria which ensure the existence of at least three positive solutions of the boundary value problem are established.
文摘Based on recent research developments in multi-objective solid transportation problem (MOSTP), this paper presents a fuzzy programming approach to determine the optimal compromise solution of MOSTP. The characteristic feature of the proposed approach is that various objectives are synthetically considered with marginal evaluation for individual objectives and global evaluation for all objectives. The decision-maker's preference is taken into account by his/her assigning weights to the objectives. With global evaluation for all objectives, a compromise programming model is formulated. As a generic aggregation operator is adopted, several solution methods proposed earlier become special cases of this approach, and the solution process also becomes more flexible and realistic. An illustrative numerical example is provided to demonstrate the approach.
基金Supported by the University Foundation of Natural Science of Anhui Province(KJ2007B055)
文摘By using fixed point theorems,we consider multiplicity of positive solutions for second-order generalized Sturm-Liouville boundary value problem,where the first order derivative is involved in the nonlinear term explicitly.We show the existence of multiple positive solutions for the problems.Example is given to illustrate the main results of the article.
文摘In this paper, we investigate not only the acceleration problem of the q-Bernstein polynomials Bn（f, q; x） to B∞ （f, q; x） but also the convergence of their iterated Boolean sum. Using the methods of exact estimate and theories of modulus of smoothness, we get the respective estimates of the convergence rate, which suggest that q-Bernstein polynomials have the similar answer with the classical Bernstein polynomials to these two problems.
文摘Over the years, a number of methods have been proposed for the generation of uniform and globally optimal Pareto frontiers in multi-objective optimization problems. This has been the case irrespective of the problem definition. The most commonly applied methods are the normal constraint method and the normal boundary intersection method. The former suffers from the deficiency of an uneven Pareto set distribution in the case of vertical （or horizontal） sections in the Pareto frontier, whereas the latter suffers from a sparsely populated Pareto frontier when the optimization problem is numerically demanding （ill-conditioned）. The method proposed in this paper, coupled with a simple Pareto filter, addresses these two deficiencies to generate a uniform, globally optimal, well-populated Pareto frontier for any feasible bi-objective optimization problem. A number of examples are provided to demonstrate the performance of the algorithm.
文摘In this paper, we consider the existence of multiple positive solutions of discrete boundary value problem. The theory of fixed point index is used here to derive the existence theorem.
基金Sponsored by the National Natural Science Foundation of China(Grant No.10571085).
文摘The existence of n positive solutions is studied for a class of fourth-order elastic beam equations where one end is fixed and other end is movable. Here, n is an arbitrary natural number. Our results show that the class of equations may have n positive solutions provided the “heights” of the nonlinear term are appropriate on some bounded sets.
文摘Genetic algorithms (GAs) employ the evolutionary process of Darwin’s nature selection theory to find the solutions of optimization problems. In this paper, an implementation of genetic algorithm is put forward to solve a classical transportation problem, namely the Hitchcock’s Transportation Problem (HTP), and the GA is improved to search for all optimal solutions and identify them automatically. The algorithm is coded with C++ and validated by numerical examples. The computational results show that the algorithm is efficient for solving the Hitchcock’s transportation problem.
基金supported by National Natural Science Foundation of China (Grant Nos.70471008, 70971072)
文摘It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.
基金supported by National Natural Science Foundation of China (Grant Nos. 91330202, 11371026, 11201501, 11571389, 11001259 and 11031006)National Basic Research Program of China (Grant No. 2011CB309703)the National Center for Mathematics and Interdisciplinary Science, Chinese Academy of Sciences, the President Foundation of Academy of Mathematics and Systems Science, Chinese Academy of Sciences and the Program for Innovation Research in Central University of Finance and Economics
文摘We introduce a type of full multigrid method for the nonlinear eigenvalue problem. The main idea is to transform the solution of the nonlinear eigenvalue problem into a series of solutions of the corresponding linear boundary value problems on the sequence of finite element spaces and nonlinear eigenvalue problems on the coarsest finite element space. The linearized boundary value problems are solved by some multigrid iterations.Besides the multigrid iteration, all other efficient iteration methods for solving boundary value problems can serve as the linear problem solver. We prove that the computational work of this new scheme is truly optimal,the same as solving the linear corresponding boundary value problem. In this case, this type of iteration scheme certainly improves the overfull efficiency of solving nonlinear eigenvalue problems. Some numerical experiments are presented to validate the efficiency of the new method.
基金supported by National Natural Science Foundation of China(Grant Nos.11226332,41204082 and 11071067)the China Postdoctoral Science Foundation(Grant No.2011M501295)+1 种基金the Research Fund for the Doctoral Program of Higher Education of China(Grant No.20120162120036)the Construct Program of the Key Discipline in Hunan Province
文摘For the Poisson equation with Robin boundary conditions,by using a few techniques such as orthogonal expansion(M-type),separation of the main part and the finite element projection,we prove for the first time that the asymptotic error expansions of bilinear finite element have the accuracy of O(h3)for u∈H3.Based on the obtained asymptotic error expansions for linear finite elements,extrapolation cascadic multigrid method(EXCMG)can be used to solve Robin problems effectively.Furthermore,by virtue of Richardson not only the accuracy of the approximation is improved,but also a posteriori error estimation is obtained.Finally,some numerical experiments that confirm the theoretical analysis are presented.
基金supported by the National Natural Science Foundation of China under Grant No.11271156Science and Technology Development Plan of Jilin Province under Grant No.20130101179JCPublic Computing Platform in Jilin Province
文摘This paper studies the minimal monomial basis of the n-variable Birkhoff interpolation problem. First, the authors give a fast B-Lex algorithm which has an explicit geometric interpretation to compute the minimal monomial interpolation basis under lexieographie order and the algorithm is in fact a generalization of lex game algorithm. In practice, people usually desire the lowest degree interpolation polynomial, so the interpolation problems need to be solved under, for example, graded monomial order instead of lexicographie order. However, there barely exist fast algorithms for the non- lexicographic order problem. Hence, the authors in addition provide a criterion to determine whether an n-variable Birkhoff interpolation problem has unique minimal monomial basis, which means it owns the same minimal monomial basis w.r.t, arbitrary monomial order. Thus, for problems in this case, the authors can easily get the minimal monomial basis with little computation cost w.r.t, arbitrary monomial order by using our fast B-Lex algorithm.
基金supported by the Taishan Scholar Construction Engineering by Shandong Governmentthe National Natural Science Foundation of China under Grant Nos.61120106011,61403235,61573221 and 61633014+2 种基金the Natural Science Foundation of Shandong Province under Grant No.ZR2014FQ011the China Postdoctoral Science Foundation under Grant No.2014M561929the Special Funds for Postdoctoral Innovation Project of Shandong Province under Grant No.201402032
文摘This paper considers the stochastic linear quadratic regulation （LQR） problem for Ito stochastic systems with multiple input controllers. The explicit controllers are given in terms of two Riccati equations by introducing one new costate and establishing the homogeneous relationship be- tween the state and the new costate. More importantly, it is more computation saving for the derived Riccati equations than the one derived by augmentation technique.
