In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function...In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.展开更多
An interval algorlthm for inequality coustrained discrete minimax problems is described, in which the constrained and objective functions are C1 functions. First, based on the penalty function methods, we trans form t...An interval algorlthm for inequality coustrained discrete minimax problems is described, in which the constrained and objective functions are C1 functions. First, based on the penalty function methods, we trans form this problem to unconstrained optimization. Second, the interval extensions of the penalty functions and the test rules of region deletion are discussed. At last, we design an interval algorithm with the bisection rule of Moore. The algorithm provides bounds on both the minimax value and the localization of the minimax points of the problem. Numerical results show that algorithm is reliable and efficiency.展开更多
In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current ...In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.展开更多
This paper studies a time-variant multi-objective linear fractional transportation problem. In reality, transported goods should reach in destinations within a specific time. Considering the importance of time, a time...This paper studies a time-variant multi-objective linear fractional transportation problem. In reality, transported goods should reach in destinations within a specific time. Considering the importance of time, a time-variant multi-objective linear fractional transportation problem is formulated here. We take into account the parameters as cost, supply and demand are interval valued that involved in the proposed model, so we treat the model as a multi-objective linear fractional interval transportation problem. To solve the formulated model, we first convert it into a deterministic form using a new transformation technique and then apply fuzzy programming to solve it. The applicability of our proposed method is shown by considering two numerical examples. At last, conclusions and future research directions regarding our study is included.展开更多
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linea...This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.展开更多
In this paper the existence of solutions of the singularly perturbed boundary value problems on infinite interval for the second order nonlinear equation containing a small parameterε>0,εy'=f(x,y,y'),y...In this paper the existence of solutions of the singularly perturbed boundary value problems on infinite interval for the second order nonlinear equation containing a small parameterε>0,εy'=f(x,y,y'),y'(0)=a,y(∞)=βis examined,where are constants,and i=0,1.Moreover,asymptotic estimates of the solutions for the above problems are given.展开更多
In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
In this paper,by using the discrete Arzelá-Ascoli Lemma and the fixed-point theorem in cones,we discuss the existence of positive solutions of the following second order discrete Sturm-Liouville boundary value pr...In this paper,by using the discrete Arzelá-Ascoli Lemma and the fixed-point theorem in cones,we discuss the existence of positive solutions of the following second order discrete Sturm-Liouville boundary value problem on infinite intervals■where Δu(x)=u(x+1)-u(x)is the forward difference operator,■is continuous,a>0,B and C are nonnegative constants.展开更多
The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Ne...The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Newton method for solving the linear complementarity problem with the regular interval matrix based on the nonlinear penalized equation. Further, we prove that this method is convergent. Numerical experiments are presented to show that the generalized Newton method is effective.展开更多
In this paper some new results for general orthogonal polynomials on infinite intervals are presented. In particular, an answer to Problem 54 of P. Turan[J. Approximation Theory, 29(1980),P.64] is given.
Based on B-spline wavelet on the interval （BSWI）, two classes of truncated conical shell elements were constructed to solve axisymmetric problems, i.e. BSWI thin truncated conical shell element and BSWI moderately t...Based on B-spline wavelet on the interval （BSWI）, two classes of truncated conical shell elements were constructed to solve axisymmetric problems, i.e. BSWI thin truncated conical shell element and BSWI moderately thick truncated conical shell element with independent slopedeformation interpolation. In the construction of wavelet-based element, instead of traditional polynomial interpolation, the scaling functions of BSWI were employed to form the shape functions through the constructed elemental transformation matrix, and then construct BSWI element via the variational principle. Unlike the process of direct wavelets adding in the wavelet Galerkin method, the elemental displacement field represented by the coefficients of wavelets expansion was transformed into edges and internal modes via the constructed transformation matrix. BSWI element combines the accuracy of B-spline function approximation and various wavelet-based elements for structural analysis. Some static and dynamic numerical examples of conical shells were studied to demonstrate the present element with higher efficiency and precision than the traditional element.展开更多
In this paper, based on the second-order Taylor series expansion and the difference of convex functions algo- rithm for quadratic problems with box constraints （the DCA for QB）, a new method is proposed to solve the...In this paper, based on the second-order Taylor series expansion and the difference of convex functions algo- rithm for quadratic problems with box constraints （the DCA for QB）, a new method is proposed to solve the static response problem of structures with fairly large uncertainties in interval parameters. Although current methods are effective for solving the static response problem of structures with interval parameters with small uncertainties, these methods may fail to estimate the region of the static response of uncertain structures if the uncertainties in the parameters are fairly large. To resolve this problem, first, the general expression of the static response of structures in terms of structural parameters is derived based on the second-order Taylor series expansion. Then the problem of determining the bounds of the static response of uncertain structures is transformed into a series of quadratic problems with box constraints. These quadratic problems with box constraints can be solved using the DCA approach effectively. The numerical examples are given to illustrate the accuracy and the efficiency of the proposed method when comparing with other existing methods.展开更多
We study the leader-following consensus stability and stabilization of networked multi-teleoperator systems with interval time-varying communication delays. With the construction of a suitable Lyapunov–Krasovskii fun...We study the leader-following consensus stability and stabilization of networked multi-teleoperator systems with interval time-varying communication delays. With the construction of a suitable Lyapunov–Krasovskii functional and the utilization of the reciprocally convex approach, novel delay-dependent consensus stability and stabilization conditions for the systems are established in terms of linear matrix inequalities, which can easily be solved by various effective optimization algorithms. One illustrative example is given to illustrate the effectiveness of the proposed methods.展开更多
Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state ...Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state function to the polynomial form to measure whether the structure is invalid.The uncertain parameters mainly exist in the form of intervals.This method requires a lot of calculation and is often difficult to achieve efficiently.In order to solve this problem,this paper proposes an interval variable multivariate polynomial algorithm based on Bernstein polynomials and evidence theory to solve the structural reliability problem with cognitive uncertainty.Based on the non-probabilistic reliability index method,the extreme value of the limit state function is obtained using the properties of Bernstein polynomials,thus avoiding the need for a lot of sampling to solve the reliability analysis problem.The method is applied to numerical examples and engineering applications such as experiments,and the results show that the method has higher computational efficiency and accuracy than the traditional linear approximation method,especially for some reliability problems with higher nonlinearity.Moreover,this method can effectively improve the reliability of results and reduce the cost of calculation in practical engineering problems.展开更多
In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitut...In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitute an interval, with a method called the sign-variation analysis. The results are compared with the parametrization technique offered by Elishakoff and Miglis, and with the solution yielded by minimization and maximization commands of the Maple software. Solutions for some interval word problems are also provided to edulcorate the methodology. This article only focuses on the real roots of those quadratic equations, complex solutions being beyond this investigation.展开更多
This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progre...This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.展开更多
This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theo...This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theorem,fixed point index theory and the analytic technique,we give the bifurcation point of the parameter which divides the range of parameter for the existence of at least two,one and no positive solutions for the problem.And,by using a fixed point theorem of generalized concave operator and cone theory,we establish the maximum parameter interval for the existence of the unique positive solution for the problem and show that such a positive solution continuously depends on the parameter.In the end,some examples are given to illustrate our main results.展开更多
We use the Fokas method to analyze the derivative nonlinear Schrodinger （DNLS） equation iqt （x, t） = -qxx （x, t）＋（rq^2）x on the interval [0, L]. Assuming that the solution q（x, t） exists, we show that it ca...We use the Fokas method to analyze the derivative nonlinear Schrodinger （DNLS） equation iqt （x, t） = -qxx （x, t）＋（rq^2）x on the interval [0, L]. Assuming that the solution q（x, t） exists, we show that it can be represented in terms of the solution of a matrix Riemann- Hilbert problem formulated in the plane of the complex spectral parameter ξ. This problem has explicit （x, t） dependence, and it has jumps across {ξ∈C｜Imξ^4 = 0}. The relevant jump matrices are explicitely given in terms of the spectral functions {a（ξ）, b（ξ）}, {A（ξ）, B（ξ）}, and {A（ξ）, B（ξ）}, which in turn are defined in terms of the initial data q0（x） = q（x, 0）, the bound- ary data g0（t）= q（0, t）, g1（t） = qx（0, t）, and another boundary values f0（t） = q（L, t）, f1（t） = qx（L, t）. The spectral functions are not independent, but related by a compatibility condition, the so-called global relation.展开更多
基金Supported by the National Natural Science Foundation of China(50 1 740 51 )
文摘In this paper,a class of unconstrained discrete minimax problems is described,in which the objective functions are in C 1.The paper deals with this problem by means of taking the place of maximum entropy function with adjustable entropy function.By constructing an interval extension of adjustable entropy function an d some region deletion test rules,a new interval algorithm is presented.The rele vant properties are proven.The minimax value and the localization of the minimax points of the problem can be obtained by this method. This method can overcome the flow problem in the maximum entropy algorithm.Both theoretical and numerica l results show that the method is reliable and efficient.
文摘An interval algorlthm for inequality coustrained discrete minimax problems is described, in which the constrained and objective functions are C1 functions. First, based on the penalty function methods, we trans form this problem to unconstrained optimization. Second, the interval extensions of the penalty functions and the test rules of region deletion are discussed. At last, we design an interval algorithm with the bisection rule of Moore. The algorithm provides bounds on both the minimax value and the localization of the minimax points of the problem. Numerical results show that algorithm is reliable and efficiency.
基金Supported by the National Natural Science Foundation of China(11971433)First Class Discipline of Zhe-jiang-A(Zhejiang Gongshang University-Statistics,1020JYN4120004G-091),Graduate Scientic Research and Innovation Foundation of Zhejiang Gongshang University.
文摘In this paper,weak optimal inverse problems of interval linear programming(IvLP)are studied based on KKT conditions.Firstly,the problem is precisely defined.Specifically,by adjusting the minimum change of the current cost coefficient,a given weak solution can become optimal.Then,an equivalent characterization of weak optimal inverse IvLP problems is obtained.Finally,the problem is simplified without adjusting the cost coefficient of null variable.
文摘This paper studies a time-variant multi-objective linear fractional transportation problem. In reality, transported goods should reach in destinations within a specific time. Considering the importance of time, a time-variant multi-objective linear fractional transportation problem is formulated here. We take into account the parameters as cost, supply and demand are interval valued that involved in the proposed model, so we treat the model as a multi-objective linear fractional interval transportation problem. To solve the formulated model, we first convert it into a deterministic form using a new transformation technique and then apply fuzzy programming to solve it. The applicability of our proposed method is shown by considering two numerical examples. At last, conclusions and future research directions regarding our study is included.
文摘This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.
文摘In this paper the existence of solutions of the singularly perturbed boundary value problems on infinite interval for the second order nonlinear equation containing a small parameterε>0,εy'=f(x,y,y'),y'(0)=a,y(∞)=βis examined,where are constants,and i=0,1.Moreover,asymptotic estimates of the solutions for the above problems are given.
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
基金Supported by the National Natural Science Foundation of China(Grant No.12361040)the Department of Education University Innovation Fund of Gansu Province(Grant No.2021A-006)。
文摘In this paper,by using the discrete Arzelá-Ascoli Lemma and the fixed-point theorem in cones,we discuss the existence of positive solutions of the following second order discrete Sturm-Liouville boundary value problem on infinite intervals■where Δu(x)=u(x+1)-u(x)is the forward difference operator,■is continuous,a>0,B and C are nonnegative constants.
文摘The penalty equation of LCP is transformed into the absolute value equation, and then the existence of solutions for the penalty equation is proved by the regularity of the interval matrix. We propose a generalized Newton method for solving the linear complementarity problem with the regular interval matrix based on the nonlinear penalized equation. Further, we prove that this method is convergent. Numerical experiments are presented to show that the generalized Newton method is effective.
基金The Project Supported by National Natural Science Foundation of China
文摘In this paper some new results for general orthogonal polynomials on infinite intervals are presented. In particular, an answer to Problem 54 of P. Turan[J. Approximation Theory, 29(1980),P.64] is given.
基金Project supported by the National Natural Science Foundation of China (Nos. 50335030, 50505033 and 50575171)National Basic Research Program of China (No. 2005CB724106)Doctoral Program Foundation of University of China(No. 20040698026)
文摘Based on B-spline wavelet on the interval （BSWI）, two classes of truncated conical shell elements were constructed to solve axisymmetric problems, i.e. BSWI thin truncated conical shell element and BSWI moderately thick truncated conical shell element with independent slopedeformation interpolation. In the construction of wavelet-based element, instead of traditional polynomial interpolation, the scaling functions of BSWI were employed to form the shape functions through the constructed elemental transformation matrix, and then construct BSWI element via the variational principle. Unlike the process of direct wavelets adding in the wavelet Galerkin method, the elemental displacement field represented by the coefficients of wavelets expansion was transformed into edges and internal modes via the constructed transformation matrix. BSWI element combines the accuracy of B-spline function approximation and various wavelet-based elements for structural analysis. Some static and dynamic numerical examples of conical shells were studied to demonstrate the present element with higher efficiency and precision than the traditional element.
基金supported by the National Natural Science Foundation of China (Grants 11002013, 11372025)the Defense Industrial Technology Development Program (Grants A0820132001, JCKY2013601B)+1 种基金the Aeronautical Science Foundation of China (Grant 2012ZA51010)111 Project (Grant B07009) for support
文摘In this paper, based on the second-order Taylor series expansion and the difference of convex functions algo- rithm for quadratic problems with box constraints （the DCA for QB）, a new method is proposed to solve the static response problem of structures with fairly large uncertainties in interval parameters. Although current methods are effective for solving the static response problem of structures with interval parameters with small uncertainties, these methods may fail to estimate the region of the static response of uncertain structures if the uncertainties in the parameters are fairly large. To resolve this problem, first, the general expression of the static response of structures in terms of structural parameters is derived based on the second-order Taylor series expansion. Then the problem of determining the bounds of the static response of uncertain structures is transformed into a series of quadratic problems with box constraints. These quadratic problems with box constraints can be solved using the DCA approach effectively. The numerical examples are given to illustrate the accuracy and the efficiency of the proposed method when comparing with other existing methods.
基金MEST&DGIST(12-IT-04,Development of the Medical&IT Convergence System)the Basic Science Research Program through the National Research Foundation of Korea(NRF)funded by the Ministry of Education,Science and Technology(Grant Nos.2011-0009273 and 2012-0000479)
文摘We study the leader-following consensus stability and stabilization of networked multi-teleoperator systems with interval time-varying communication delays. With the construction of a suitable Lyapunov–Krasovskii functional and the utilization of the reciprocally convex approach, novel delay-dependent consensus stability and stabilization conditions for the systems are established in terms of linear matrix inequalities, which can easily be solved by various effective optimization algorithms. One illustrative example is given to illustrate the effectiveness of the proposed methods.
文摘Structural reliability is an important method to measure the safety performance of structures under the influence of uncertain factors.Traditional structural reliability analysis methods often convert the limit state function to the polynomial form to measure whether the structure is invalid.The uncertain parameters mainly exist in the form of intervals.This method requires a lot of calculation and is often difficult to achieve efficiently.In order to solve this problem,this paper proposes an interval variable multivariate polynomial algorithm based on Bernstein polynomials and evidence theory to solve the structural reliability problem with cognitive uncertainty.Based on the non-probabilistic reliability index method,the extreme value of the limit state function is obtained using the properties of Bernstein polynomials,thus avoiding the need for a lot of sampling to solve the reliability analysis problem.The method is applied to numerical examples and engineering applications such as experiments,and the results show that the method has higher computational efficiency and accuracy than the traditional linear approximation method,especially for some reliability problems with higher nonlinearity.Moreover,this method can effectively improve the reliability of results and reduce the cost of calculation in practical engineering problems.
文摘In this article, analytical results are obtained apparently for the first time in the literature, for the lower and upper bounds of the roots of quadratic equations when two or all three coefficients a, b, c constitute an interval, with a method called the sign-variation analysis. The results are compared with the parametrization technique offered by Elishakoff and Miglis, and with the solution yielded by minimization and maximization commands of the Maple software. Solutions for some interval word problems are also provided to edulcorate the methodology. This article only focuses on the real roots of those quadratic equations, complex solutions being beyond this investigation.
文摘This study utilizes a time-precedence network technique to construct two models of multi-mode resource constrained project scheduling problem with discounted cash flows （MRCPSPDCF）, individually including the progress payment （PP） and the payment at an equal time interval （ETI）. The objective of each model is to maximize the net present value （NPV） for all cash flows in the project, subject to the related operational constraints. The models are characterized as NP-hard. A heuristic algorithm, coupled with two upper bound solutions, is proposed to efficiently solve the models and evaluate the heuristic algorithm performance which was not performed in past studies. The results show that the performance of proposed models and heuristic algorithm is good.
基金Supported by the National Natural Science Foundation of China(11361047)Fundamental Research Program of Shanxi Province(20210302124529)。
文摘This paper is concerned with a class of nonlinear fractional differential equations with a disturbance parameter in the integral boundary conditions on the infinite interval.By using Guo-Krasnoselskii fixed point theorem,fixed point index theory and the analytic technique,we give the bifurcation point of the parameter which divides the range of parameter for the existence of at least two,one and no positive solutions for the problem.And,by using a fixed point theorem of generalized concave operator and cone theory,we establish the maximum parameter interval for the existence of the unique positive solution for the problem and show that such a positive solution continuously depends on the parameter.In the end,some examples are given to illustrate our main results.
基金supported by grants from the National Science Foundation of China (10971031 11271079+2 种基金 11075055)Doctoral Programs Foundation of the Ministry of Education of Chinathe Shanghai Shuguang Tracking Project (08GG01)
文摘We use the Fokas method to analyze the derivative nonlinear Schrodinger （DNLS） equation iqt （x, t） = -qxx （x, t）＋（rq^2）x on the interval [0, L]. Assuming that the solution q（x, t） exists, we show that it can be represented in terms of the solution of a matrix Riemann- Hilbert problem formulated in the plane of the complex spectral parameter ξ. This problem has explicit （x, t） dependence, and it has jumps across {ξ∈C｜Imξ^4 = 0}. The relevant jump matrices are explicitely given in terms of the spectral functions {a（ξ）, b（ξ）}, {A（ξ）, B（ξ）}, and {A（ξ）, B（ξ）}, which in turn are defined in terms of the initial data q0（x） = q（x, 0）, the bound- ary data g0（t）= q（0, t）, g1（t） = qx（0, t）, and another boundary values f0（t） = q（L, t）, f1（t） = qx（L, t）. The spectral functions are not independent, but related by a compatibility condition, the so-called global relation.
