A scalar equilibrium (SE) is defined for n-person prescriptive games in normal form. When a decision criterion (notion of rationality) is either agreed upon by the players or prescribed by an external arbiter, the res...A scalar equilibrium (SE) is defined for n-person prescriptive games in normal form. When a decision criterion (notion of rationality) is either agreed upon by the players or prescribed by an external arbiter, the resulting decision process is modeled by a suitable scalar transformation (utility function). Each n-tuple of von Neumann-Morgenstern utilities is transformed into a nonnegative scalar value between 0 and 1. Any n-tuple yielding a largest scalar value determines an SE, which is always a pure strategy profile. SEs can be computed much faster than Nash equilibria, for example;and the decision criterion need not be based on the players’ selfishness. To illustrate the SE, we define a compromise equilibrium, establish its Pareto optimality, and present examples comparing it to other solution concepts.展开更多
Today's machine tool industries are facing unprecedented challenges brought about by development of outsourcing and low cost manufacturing in Asia. Manufacturing outsourcing provided many opportunities but also ad...Today's machine tool industries are facing unprecedented challenges brought about by development of outsourcing and low cost manufacturing in Asia. Manufacturing outsourcing provided many opportunities but also added challenges to produce and deliver products with improved productivity, quality, service and costs. Lead times must be cut short to their extreme extend to meet need the changing demands展开更多
An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed app...An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed approach is significantly faster than previous active-set and standard linear programming algorithms.展开更多
We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add mul...We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add multiple constraints. We give an interpretation of the new COST’s selection rule, which considers both the depth of constraints as well as their angles from the objective function. We provide computational comparisons of the COST with existing linear programming algorithms, including other COSTs in the literature, for some large-scale problems. Finally, we discuss conclusions and future research.展开更多
In this paper we study the Hardy type estimates for commutators Tb of standard Calder(o)n-Zygmund singular integral operators T with a Lipschitz function b. The corresponding results are also obtained on the commutato...In this paper we study the Hardy type estimates for commutators Tb of standard Calder(o)n-Zygmund singular integral operators T with a Lipschitz function b. The corresponding results are also obtained on the commutators Sb generated by b with singular integral operators S with variable kernels.展开更多
文摘A scalar equilibrium (SE) is defined for n-person prescriptive games in normal form. When a decision criterion (notion of rationality) is either agreed upon by the players or prescribed by an external arbiter, the resulting decision process is modeled by a suitable scalar transformation (utility function). Each n-tuple of von Neumann-Morgenstern utilities is transformed into a nonnegative scalar value between 0 and 1. Any n-tuple yielding a largest scalar value determines an SE, which is always a pure strategy profile. SEs can be computed much faster than Nash equilibria, for example;and the decision criterion need not be based on the players’ selfishness. To illustrate the SE, we define a compromise equilibrium, establish its Pareto optimality, and present examples comparing it to other solution concepts.
文摘Today's machine tool industries are facing unprecedented challenges brought about by development of outsourcing and low cost manufacturing in Asia. Manufacturing outsourcing provided many opportunities but also added challenges to produce and deliver products with improved productivity, quality, service and costs. Lead times must be cut short to their extreme extend to meet need the changing demands
文摘An efficient active-set approach is presented for both nonnegative and general linear programming by adding varying numbers of constraints at each iteration. Computational experiments demonstrate that the proposed approach is significantly faster than previous active-set and standard linear programming algorithms.
文摘We describe a new active-set, cutting-plane Constraint Optimal Selection Technique (COST) for solving general linear programming problems. We describe strategies to bound the initial problem and simultaneously add multiple constraints. We give an interpretation of the new COST’s selection rule, which considers both the depth of constraints as well as their angles from the objective function. We provide computational comparisons of the COST with existing linear programming algorithms, including other COSTs in the literature, for some large-scale problems. Finally, we discuss conclusions and future research.
基金This work was supported by the National Natural Science Foundation of China(Grant Nos.10041005&10171045).
文摘In this paper we study the Hardy type estimates for commutators Tb of standard Calder(o)n-Zygmund singular integral operators T with a Lipschitz function b. The corresponding results are also obtained on the commutators Sb generated by b with singular integral operators S with variable kernels.
