Motivated by the converse Lyapunov technique for investigating converse results of semistable switched systems in control theory,this paper utilizes a constructive induction method to identify a cost function for perf...Motivated by the converse Lyapunov technique for investigating converse results of semistable switched systems in control theory,this paper utilizes a constructive induction method to identify a cost function for performance gauge of an average,multi-cue multi-choice(MCMC),cognitive decision making model over a switching time interval.It shows that such a constructive cost function can be evaluated through an abstract energy called Lyapunov function at initial conditions.Hence,the performance gauge problem for the average MCMC model becomes the issue of finding such a Lyapunov function,leading to a possible way for designing corresponding computational algorithms via iterative methods such as adaptive dynamic programming.In order to reach this goal,a series of technical results are presented for the construction of such a Lyapunov function and its mathematical properties are discussed in details.Finally,a major result of guaranteeing the existence of such a Lyapunov function is rigorously proved.展开更多
In this paper we derive a multi-choice TU game from r-replica of exchange economy with continuous, concave and monetary utility functions, and prove that the cores of the games converge to a subset of the set of Edgew...In this paper we derive a multi-choice TU game from r-replica of exchange economy with continuous, concave and monetary utility functions, and prove that the cores of the games converge to a subset of the set of Edgeworth equilibria of exchange economy as r approaches to infinity. We prove that the dominance core of each balanced multi-choice TU game, where each player has identical activity level r, coincides with the dominance core of its corresponding r-replica of exchange economy. We also give an extension of the concept of the cover of the game proposed by Shapley and Shubik （J Econ Theory 1： 9-25, 1969） to multi-choice TU games and derive some sufficient conditions for the nonemptyness of the core of multi-choice TU game by using the relationship among replica economies, multi-choice TU games and their covers.展开更多
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 analyzes the multi-choice stochastic transportation problem where the cost coefficients of the objective function and the demand parameters of the constraints follow multi-choice parameters.Assume that the ...This paper analyzes the multi-choice stochastic transportation problem where the cost coefficients of the objective function and the demand parameters of the constraints follow multi-choice parameters.Assume that the supply parameters of the constraints in a transportation problem(TP)follow logistic distribution.The main objective of this paper is to select an appropriate choice from the multi-choices for the cost coefficients of the objective function and the demand of the constraints in the TP by introducing Lagrange’s interpolating polynomial in such a way that the total cost is minimized and satisfies the required demand.Using stochastic programming,the stochastic supply constraints of the TP are transformed into deterministic constraints.Finally,a non-linear deterministic model is formulated.Using Lingo software,the optimal solution of the proposed problem is derived.To illustrate the methodology,a real-life problem on the TP is considered.展开更多
In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation...In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.展开更多
文摘Motivated by the converse Lyapunov technique for investigating converse results of semistable switched systems in control theory,this paper utilizes a constructive induction method to identify a cost function for performance gauge of an average,multi-cue multi-choice(MCMC),cognitive decision making model over a switching time interval.It shows that such a constructive cost function can be evaluated through an abstract energy called Lyapunov function at initial conditions.Hence,the performance gauge problem for the average MCMC model becomes the issue of finding such a Lyapunov function,leading to a possible way for designing corresponding computational algorithms via iterative methods such as adaptive dynamic programming.In order to reach this goal,a series of technical results are presented for the construction of such a Lyapunov function and its mathematical properties are discussed in details.Finally,a major result of guaranteeing the existence of such a Lyapunov function is rigorously proved.
基金Supported by the Natural Science Foundation of Hebei Province of China(A2014205152)
文摘In this paper we derive a multi-choice TU game from r-replica of exchange economy with continuous, concave and monetary utility functions, and prove that the cores of the games converge to a subset of the set of Edgeworth equilibria of exchange economy as r approaches to infinity. We prove that the dominance core of each balanced multi-choice TU game, where each player has identical activity level r, coincides with the dominance core of its corresponding r-replica of exchange economy. We also give an extension of the concept of the cover of the game proposed by Shapley and Shubik （J Econ Theory 1： 9-25, 1969） to multi-choice TU games and derive some sufficient conditions for the nonemptyness of the core of multi-choice TU game by using the relationship among replica economies, multi-choice TU games and their covers.
文摘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 analyzes the multi-choice stochastic transportation problem where the cost coefficients of the objective function and the demand parameters of the constraints follow multi-choice parameters.Assume that the supply parameters of the constraints in a transportation problem(TP)follow logistic distribution.The main objective of this paper is to select an appropriate choice from the multi-choices for the cost coefficients of the objective function and the demand of the constraints in the TP by introducing Lagrange’s interpolating polynomial in such a way that the total cost is minimized and satisfies the required demand.Using stochastic programming,the stochastic supply constraints of the TP are transformed into deterministic constraints.Finally,a non-linear deterministic model is formulated.Using Lingo software,the optimal solution of the proposed problem is derived.To illustrate the methodology,a real-life problem on the TP is considered.
基金supported by the Shanghai Applied Materials Foundation (Grant No.06SA18)
文摘In this paper, a novel scheduling mechanism is proposed to handle the real-time overload problem by maximizing the cumulative values of three types of tasks： the soft, the hard and the imprecise tasks. The simulation results show that the performance of our presented mechanism in this paper is greatly improved, much better than that of the other three mechanisms： earliest deadline first （EDF）, highest value first （HVF） and highest density first （HDF）, under the same conditions of all nominal loads and task type proportions.
