In operations research, the transportation problem (TP) is among the earliest and most effective applications of the linear programming problem. Unbalanced transportation problems reflect the reality of supply chain a...In operations research, the transportation problem (TP) is among the earliest and most effective applications of the linear programming problem. Unbalanced transportation problems reflect the reality of supply chain and logistics situations where the available supply of goods may not precisely match the demand at different locations. To deal with an unbalanced transportation problem (UTP), it is essential first to convert it into a balanced transportation problem (BTP) to find an initial basic feasible solution (IBFS) and hence the optimal solution. The present paper is concerned with introducing a new approach to convert an unbalanced transportation problem into a balanced one and as a consequence to obtain optimum total transportation cost. Numerical examples are provided to demonstrate the suggested method.展开更多
In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to dif...In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to different factors. Finding optimal solutions to the transportation problem in the context of variations in cost is vital for ensuring cost efficiency, resource allocation, customer satisfaction, competitive advantage, environmental responsibility, risk mitigation, and operational fortitude in practical situations. This paper opens up new directions for the solution of transportation problems by introducing two key theorems. By using these theorems, we can develop an algorithm for identifying the optimal solution attributes and permitting accurate quantification of changes in overall transportation costs through the addition or subtraction of constants to specific rows or columns, as well as multiplication by constants inside the cost matrix. It is anticipated that the two reliable techniques presented in this study will provide theoretical insights and practical solutions to enhance the efficiency and cost-effectiveness of transportation systems. Finally, numerical illustrations are presented to verify the proposed approaches.展开更多
Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for tran...Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method.展开更多
The structure of the optimal solution set is derived for linear fractional programming with the representation theorem of polyhedral sets. Based on an adaptation of the convex simplex method credited to Gilmore and Go...The structure of the optimal solution set is derived for linear fractional programming with the representation theorem of polyhedral sets. Based on an adaptation of the convex simplex method credited to Gilmore and Gomory, we give the uniqueness condition of optimal solution and the computational procedures to find all optimal solutions if the uniqueness condition is not satisfied. Finally, an illustrative example is also given.展开更多
A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting...A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization (IMOPSO) is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions (A, B, C) of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-II (NSGA-II), IMOPSO has close global op- timization capability and is suitable for multi-objective optimization problems.展开更多
The optimization problem is considered in which the objective function is pseudolinear(both pseudoconvex and pseudoconcave) and the constraints are linear. The general expression for the optimal solutions to the probl...The optimization problem is considered in which the objective function is pseudolinear(both pseudoconvex and pseudoconcave) and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions (if the uniqueness condition is not satisfied) are provided. Finally, an illustrative example is also given.展开更多
With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions ...With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.展开更多
A major challenge of any optimization problem is to find the global optimum solution. In a multi-dimensional solution space which is highly non-linear, often the optimization algorithm gets trapped around some local o...A major challenge of any optimization problem is to find the global optimum solution. In a multi-dimensional solution space which is highly non-linear, often the optimization algorithm gets trapped around some local optima. Optimal Identification of unknown groundwater pollution sources poses similar challenges. Optimization based methodology is often applied to identify the unknown source characteristics such as location and flux release history over time, in a polluted aquifer. Optimization based models for identification of these characteristics of unknown ground-water pollution sources rely on comparing the simulated effects of candidate solutions to the observed effects in terms of pollutant concentration at specified sparse spatiotemporal locations. The optimization model minimizes the difference between the observed pollutant concentration measurements and simulated pollutant concentration measurements. This essentially constitutes the objective function of the optimization model. However, the mathematical formulation of the objective function can significantly affect the accuracy of the results by altering the response contour of the solution space. In this study, two separate mathematical formulations of the objective function are compared for accuracy, by incorporating different scenarios of unknown groundwater pollution source identification problem. Simulated Annealing (SA) is used as the solution algorithm for the optimization model. Different mathematical formulations of the objective function for minimizing the difference between the observed and simulated pollutant concentration measurements show different levels of accuracy in source identification results. These evaluation results demonstrate the impact of objective function formulation on the optimal identification, and provide a basis for choosing an appropriate mathematical formulation for unknown pollution source identification in contaminated aquifers.展开更多
For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have ...For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have given an efficient heuristic (complexity O(n3) procedure to give a very good primal solution (that is generally non-basic feasible solution) to transportation problem by using the very good dual solution given by Sharma and Sharma [2]. In this paper we use the solution given by Sharma and Prasad [2] to get a very good Basic Feasible Solution to transportation problem, so that network simplex (worst case complexity (O(n3*(log(n))) can be used to reach the optimal solution to transportation problem. In the second part of this paper, we give a simple heuristic procedure to get a very good BFS to linear programming problem from the solution given by Karmarkar [3] (that generally produces a very good non-basic feasible solution in polynomial time (O(n5.5)). We give a procedure to obtain a good BFS for LP by starting from the solution given by Karmarkar [3]. We note that this procedure (given here) is significantly different from the procedure given in [4].展开更多
This paper describes and explores a maximum-entropy approach to continuous minimax problem, which is applicable in many fields, such as transportation planning and game theory. It illustrates that the maximum entropy ...This paper describes and explores a maximum-entropy approach to continuous minimax problem, which is applicable in many fields, such as transportation planning and game theory. It illustrates that the maximum entropy approcach has easy framework and proves that every accumulation of {x_k} generated by maximum-entropy programming is -optimal solution of initial continuous minimax problem. The paper also explains BFGS or TR method for it. Two numerical exam.ples for continuous minimax problem are展开更多
In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successf...In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to Equal Cycle Time and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under Visual Basic Programming platform using Intel? CoreTM2 Duo T6500 Processor.展开更多
To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-...To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value func-tion and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more im-portantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.展开更多
We prove that the model with physical and human capital adjustment costs has optimal solution when the production function is increasing return and the structure of vetor fields of the model changes substantially when...We prove that the model with physical and human capital adjustment costs has optimal solution when the production function is increasing return and the structure of vetor fields of the model changes substantially when the prodution function from decreasing return turns to increasing return.And it is shown that the economy is improved when the coefficients of adjustment costs become small.展开更多
The study deals with the multi-choice mathematical programming problem, where the right hand side of the constraints is multi-choice in nature. However, the problem of multi-choice linear programming cannot be solved ...The study deals with the multi-choice mathematical programming problem, where the right hand side of the constraints is multi-choice in nature. However, the problem of multi-choice linear programming cannot be solved directly by standard linear or nonlinear programming techniques. The aim of this paper is to transform such problems to a standard mathematical linear programming problem. For each constraint, exactly one parameter value is selected out of a multiple number of parameter values. This process of selection can be established in different ways. In this paper, we present a new simple technique enabling us to handle such problem as a mixed integer linear programming problem and consequently solve them by using standard linear programming software. Our main aim depends on inserting a specific number of binary variables and using them to construct a linear combination which gives just one parameter among the multiple choice values for each choice of the values of the binary variables. A numerical example is presented to illustrate our analysis.展开更多
This paper is concerned with the Navier-Stokes/Allen-Cahn system,which is used to model the dynamics of immiscible two-phase flows.We consider a 1D free boundary problem and assume that the viscosity coefficient depen...This paper is concerned with the Navier-Stokes/Allen-Cahn system,which is used to model the dynamics of immiscible two-phase flows.We consider a 1D free boundary problem and assume that the viscosity coefficient depends on the density in the form ofη(ρ)=ρ^(α).The existence of unique global H^(2m)-solutions(m∈N)to the free boundary problem is proven for when 0<α<1/4.Furthermore,we obtain the global C^(∞)-solutions if the initial data is smooth.展开更多
In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the ta...In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .展开更多
In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in...In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.展开更多
This paper studies the(2+1)-dimensional Hirota-Satsuma-Ito equation.Based on an associated Hirota bilinear form,lump-type solution,two types of interaction solutions,and breather wave solution of the(2+1)-dimensional ...This paper studies the(2+1)-dimensional Hirota-Satsuma-Ito equation.Based on an associated Hirota bilinear form,lump-type solution,two types of interaction solutions,and breather wave solution of the(2+1)-dimensional Hirota-Satsuma-Ito equation are obtained,which are all related to the seed solution of the equation.It is interesting that the rogue wave is aroused by the interaction between one-lump soliton and a pair of resonance stripe solitons,and the fusion and fission phenomena are also found in the interaction between lump solitons and one-stripe soliton.Furthermore,the breather wave solution is also obtained by reducing the two-soliton solutions.The trajectory and period of the one-order breather wave are analyzed.The corresponding dynamical characteristics are demonstrated by the graphs.展开更多
文摘In operations research, the transportation problem (TP) is among the earliest and most effective applications of the linear programming problem. Unbalanced transportation problems reflect the reality of supply chain and logistics situations where the available supply of goods may not precisely match the demand at different locations. To deal with an unbalanced transportation problem (UTP), it is essential first to convert it into a balanced transportation problem (BTP) to find an initial basic feasible solution (IBFS) and hence the optimal solution. The present paper is concerned with introducing a new approach to convert an unbalanced transportation problem into a balanced one and as a consequence to obtain optimum total transportation cost. Numerical examples are provided to demonstrate the suggested method.
文摘In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to different factors. Finding optimal solutions to the transportation problem in the context of variations in cost is vital for ensuring cost efficiency, resource allocation, customer satisfaction, competitive advantage, environmental responsibility, risk mitigation, and operational fortitude in practical situations. This paper opens up new directions for the solution of transportation problems by introducing two key theorems. By using these theorems, we can develop an algorithm for identifying the optimal solution attributes and permitting accurate quantification of changes in overall transportation costs through the addition or subtraction of constants to specific rows or columns, as well as multiplication by constants inside the cost matrix. It is anticipated that the two reliable techniques presented in this study will provide theoretical insights and practical solutions to enhance the efficiency and cost-effectiveness of transportation systems. Finally, numerical illustrations are presented to verify the proposed approaches.
文摘Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method.
文摘The structure of the optimal solution set is derived for linear fractional programming with the representation theorem of polyhedral sets. Based on an adaptation of the convex simplex method credited to Gilmore and Gomory, we give the uniqueness condition of optimal solution and the computational procedures to find all optimal solutions if the uniqueness condition is not satisfied. Finally, an illustrative example is also given.
基金National Science Fund for Distinguished Young Scholars (No.50725929)National Natural Science Foundation ofChina (No.50539060,50679052)
文摘A multi-objective optimal operation model of water-sedimentation-power in reservoir is established with power-generation, sedimentation and water storage taken into account. Moreover, the inertia weight self-adjusting mechanism and Pareto-optimal archive are introduced into the particle swarm optimization and an improved multi-objective particle swarm optimization (IMOPSO) is proposed. The IMOPSO is employed to solve the optimal model and obtain the Pareto-optimal front. The multi-objective optimal operation of Wanjiazhai Reservoir during the spring breakup was investigated with three typical flood hydrographs. The results show that the former method is able to obtain the Pareto-optimal front with a uniform distribution property. Different regions (A, B, C) of the Pareto-optimal front correspond to the optimized schemes in terms of the objectives of sediment deposition, sediment deposition and power generation, and power generation, respectively. The level hydrographs and outflow hydrographs show the operation of the reservoir in details. Compared with the non-dominated sorting genetic algorithm-II (NSGA-II), IMOPSO has close global op- timization capability and is suitable for multi-objective optimization problems.
文摘The optimization problem is considered in which the objective function is pseudolinear(both pseudoconvex and pseudoconcave) and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions (if the uniqueness condition is not satisfied) are provided. Finally, an illustrative example is also given.
文摘With the expression theorem of convex polyhedron, this paper gives the general expression for the solutions in standard linear programming problems. And the calculation procedures in determining the optimal solutions are also given.
文摘A major challenge of any optimization problem is to find the global optimum solution. In a multi-dimensional solution space which is highly non-linear, often the optimization algorithm gets trapped around some local optima. Optimal Identification of unknown groundwater pollution sources poses similar challenges. Optimization based methodology is often applied to identify the unknown source characteristics such as location and flux release history over time, in a polluted aquifer. Optimization based models for identification of these characteristics of unknown ground-water pollution sources rely on comparing the simulated effects of candidate solutions to the observed effects in terms of pollutant concentration at specified sparse spatiotemporal locations. The optimization model minimizes the difference between the observed pollutant concentration measurements and simulated pollutant concentration measurements. This essentially constitutes the objective function of the optimization model. However, the mathematical formulation of the objective function can significantly affect the accuracy of the results by altering the response contour of the solution space. In this study, two separate mathematical formulations of the objective function are compared for accuracy, by incorporating different scenarios of unknown groundwater pollution source identification problem. Simulated Annealing (SA) is used as the solution algorithm for the optimization model. Different mathematical formulations of the objective function for minimizing the difference between the observed and simulated pollutant concentration measurements show different levels of accuracy in source identification results. These evaluation results demonstrate the impact of objective function formulation on the optimal identification, and provide a basis for choosing an appropriate mathematical formulation for unknown pollution source identification in contaminated aquifers.
文摘For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have given an efficient heuristic (complexity O(n3) procedure to give a very good primal solution (that is generally non-basic feasible solution) to transportation problem by using the very good dual solution given by Sharma and Sharma [2]. In this paper we use the solution given by Sharma and Prasad [2] to get a very good Basic Feasible Solution to transportation problem, so that network simplex (worst case complexity (O(n3*(log(n))) can be used to reach the optimal solution to transportation problem. In the second part of this paper, we give a simple heuristic procedure to get a very good BFS to linear programming problem from the solution given by Karmarkar [3] (that generally produces a very good non-basic feasible solution in polynomial time (O(n5.5)). We give a procedure to obtain a good BFS for LP by starting from the solution given by Karmarkar [3]. We note that this procedure (given here) is significantly different from the procedure given in [4].
基金The Project was supported by National Natural Science Foundation of china.
文摘This paper describes and explores a maximum-entropy approach to continuous minimax problem, which is applicable in many fields, such as transportation planning and game theory. It illustrates that the maximum entropy approcach has easy framework and proves that every accumulation of {x_k} generated by maximum-entropy programming is -optimal solution of initial continuous minimax problem. The paper also explains BFGS or TR method for it. Two numerical exam.ples for continuous minimax problem are
文摘In this paper we proposed an AMH Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to Equal Cycle Time and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under Visual Basic Programming platform using Intel? CoreTM2 Duo T6500 Processor.
基金Supported by the National Natural Science Foundation of China(10571141,70971109)the Key Projectof the National Natural Science Foundation of China(70531030)
文摘To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value func-tion and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more im-portantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs.
文摘We prove that the model with physical and human capital adjustment costs has optimal solution when the production function is increasing return and the structure of vetor fields of the model changes substantially when the prodution function from decreasing return turns to increasing return.And it is shown that the economy is improved when the coefficients of adjustment costs become small.
文摘The study deals with the multi-choice mathematical programming problem, where the right hand side of the constraints is multi-choice in nature. However, the problem of multi-choice linear programming cannot be solved directly by standard linear or nonlinear programming techniques. The aim of this paper is to transform such problems to a standard mathematical linear programming problem. For each constraint, exactly one parameter value is selected out of a multiple number of parameter values. This process of selection can be established in different ways. In this paper, we present a new simple technique enabling us to handle such problem as a mixed integer linear programming problem and consequently solve them by using standard linear programming software. Our main aim depends on inserting a specific number of binary variables and using them to construct a linear combination which gives just one parameter among the multiple choice values for each choice of the values of the binary variables. A numerical example is presented to illustrate our analysis.
基金supported by the Key Project of the NSFC(12131010)the NSFC(11771155,12271032)+1 种基金the NSF of Guangdong Province(2021A1515010249,2021A1515010303)supported by the NSFC(11971179,12371205)。
文摘This paper is concerned with the Navier-Stokes/Allen-Cahn system,which is used to model the dynamics of immiscible two-phase flows.We consider a 1D free boundary problem and assume that the viscosity coefficient depends on the density in the form ofη(ρ)=ρ^(α).The existence of unique global H^(2m)-solutions(m∈N)to the free boundary problem is proven for when 0<α<1/4.Furthermore,we obtain the global C^(∞)-solutions if the initial data is smooth.
文摘In this paper, two different methods are used to study the cyclic structure solution and the optimal approximation of the quaternion Stein equation AXB - X = F . Firstly, the matrix equation equivalent to the target structure matrix is constructed by using the complex decomposition of the quaternion matrix, to obtain the necessary and sufficient conditions for the existence of the cyclic solution of the equation and the expression of the general solution. Secondly, the Stein equation is converted into the Sylvester equation by adding the necessary parameters, and the condition for the existence of a cyclic solution and the expression of the equation’s solution are then obtained by using the real decomposition of the quaternion matrix and the Kronecker product of the matrix. At the same time, under the condition that the solution set is non-empty, the optimal approximation solution to the given quaternion circulant matrix is obtained by using the property of Frobenius norm property. Numerical examples are given to verify the correctness of the theoretical results and the feasibility of the proposed method. .
基金supported by Vicerrectoría de Investigación y Extensión of Universidad Industrial de Santander,Colombia,project 3704.
文摘In this paper we study a bilinear optimal control problem for a diffusive Lotka-Volterra competition model with chemo-repulsion in a bounded domain of ℝ^(ℕ),N=2,3.This model describes the competition of two species in which one of them avoid encounters with rivals through a chemo-repulsion mechanism.We prove the existence and uniqueness of weak-strong solutions,and then we analyze the existence of a global optimal solution for a related bilinear optimal control problem,where the control is acting on the chemical signal.Posteriorly,we derive first-order optimality conditions for local optimal solutions using the Lagrange multipliers theory.Finally,we propose a discrete approximation scheme of the optimality system based on the gradient method,which is validated with some computational experiments.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.12275172 and 11905124)。
文摘This paper studies the(2+1)-dimensional Hirota-Satsuma-Ito equation.Based on an associated Hirota bilinear form,lump-type solution,two types of interaction solutions,and breather wave solution of the(2+1)-dimensional Hirota-Satsuma-Ito equation are obtained,which are all related to the seed solution of the equation.It is interesting that the rogue wave is aroused by the interaction between one-lump soliton and a pair of resonance stripe solitons,and the fusion and fission phenomena are also found in the interaction between lump solitons and one-stripe soliton.Furthermore,the breather wave solution is also obtained by reducing the two-soliton solutions.The trajectory and period of the one-order breather wave are analyzed.The corresponding dynamical characteristics are demonstrated by the graphs.
