With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the m...With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.展开更多
In this paper,Waish functions are applied to dynamical system analysis. An operational matrix for differential is developed first and compared with M. S. Corrington's method vis a simple example. Then this operati...In this paper,Waish functions are applied to dynamical system analysis. An operational matrix for differential is developed first and compared with M. S. Corrington's method vis a simple example. Then this operational matrix is used to analyze both time-invariant and time-variant systems ,and examples are presented respectively.展开更多
In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission ...In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi＇s, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.展开更多
Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the c...Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the central path,and its polynomial-time complexity bound is given.Finally,two numerical experiments are provided to show the effectiveness of the proposed algorithms.展开更多
The optimization models and algorithms with their implementations on flow over time problems have been an emerging field of research because of largely increasing human-created and natural disasters worldwide.For an o...The optimization models and algorithms with their implementations on flow over time problems have been an emerging field of research because of largely increasing human-created and natural disasters worldwide.For an optimal use of transportation network to shift affected people and normalize the disastrous situation as quickly and efficiently as possible,contraflow configuration is one of the highly applicable operations research(OR)models.It increases the outbound road capacities by reversing the direction of arcs towards the safe destinations that not only minimize the congestion and increase the flow but also decrease the evacuation time significantly.In this paper,we sketch the state of quickest flow solutions and solve the quickest contraflow problem with constant transit times on arcs proving that the problem can be solved in strongly polynomial time O(nm^2(long n)~2)where n and m are number of nodes and number of arcs,respectively in the network.This contraflow solution has the same computational time bound as that of the best min-cost flow solution.Moreover,we also introduce the contraflow approach with load dependent transit times on arcs and present an efficient algorithm to solve the quickest contraflow problem approximately.Supporting the claim,our computational experiments on Kathmandu road network and on randomly generated instances perform very well matching the theoretical results.For a sufficiently large number of evacuees,about double flow can be shifted with the same evacuation time and about half time is sufficient to push the given flow value with contraflow reconfiguration.展开更多
基金Supported by Science and Technology Foundation of China University of Mining & Technology
文摘With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.
文摘In this paper,Waish functions are applied to dynamical system analysis. An operational matrix for differential is developed first and compared with M. S. Corrington's method vis a simple example. Then this operational matrix is used to analyze both time-invariant and time-variant systems ,and examples are presented respectively.
文摘In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer＇s substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi＇s, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.
基金Foundation item： the Natural Science Foundation of Education Department of Hebei Province （No. D200613009）.
文摘Based on the idea of Dikin-type primal-dual affine scaling method for linear program-ming,we describe a high-order Dikin-type algorithm for P_*(κ)-matrix linear complementarity problem in a wide neighborhood of the central path,and its polynomial-time complexity bound is given.Finally,two numerical experiments are provided to show the effectiveness of the proposed algorithms.
基金supported by Deutscher Akademischer Austauschdienst (German Academic Exchange Service) Partnership Program (with University of Kaiserslautern, Germany and Mindanao State University, Iligan Institute of Technology, Iligan, Philippines)Av H Research Group Linkage Program (with Technische Universitt Bergakademie Freiberg) in Graph Theory and Optimization at Central Department of Mathematics, Tribhuvan University, Kathmandu, Nepalsupported by the Av H Foundation for the Georg Forster Research Fellowship for post doctoral researchers at Technische Universitt Bergakademie Freiberg Germany
文摘The optimization models and algorithms with their implementations on flow over time problems have been an emerging field of research because of largely increasing human-created and natural disasters worldwide.For an optimal use of transportation network to shift affected people and normalize the disastrous situation as quickly and efficiently as possible,contraflow configuration is one of the highly applicable operations research(OR)models.It increases the outbound road capacities by reversing the direction of arcs towards the safe destinations that not only minimize the congestion and increase the flow but also decrease the evacuation time significantly.In this paper,we sketch the state of quickest flow solutions and solve the quickest contraflow problem with constant transit times on arcs proving that the problem can be solved in strongly polynomial time O(nm^2(long n)~2)where n and m are number of nodes and number of arcs,respectively in the network.This contraflow solution has the same computational time bound as that of the best min-cost flow solution.Moreover,we also introduce the contraflow approach with load dependent transit times on arcs and present an efficient algorithm to solve the quickest contraflow problem approximately.Supporting the claim,our computational experiments on Kathmandu road network and on randomly generated instances perform very well matching the theoretical results.For a sufficiently large number of evacuees,about double flow can be shifted with the same evacuation time and about half time is sufficient to push the given flow value with contraflow reconfiguration.
