نتایج جستجو برای: separable programming
تعداد نتایج: 343118 فیلتر نتایج به سال:
Abstract We show that adjustable robust linear programs with affinely box data uncertainties under separable polynomial decision rules admit exact sums of squares (SOS) reformulations. These problems share the same optimal values and a one-to-one correspondence between solutions. A sum representation non-negativity non-convex over plays key role in reformulation. This reformulation allows us to...
We bring together the theories of duality and dynamic programming. We show that the dual of an additively separable dynamic optimization problem can be recursively decomposed using summaries of past Lagrange multipliers as state variables. Analogous to the Bellman decomposition of the primal problem, we prove equality of values and solution sets for recursive and sequential dual problems. In no...
In this paper we present necessary conditions for global optimality for polynomial problems over box or bivalent constraints using separable polynomial relaxations. We achieve this by completely characterizing global optimality of separable polynomial problems with box as well as bivalent constraints. Then, by employing separable polynomial under-estimators, we establish sufficient conditions f...
In the parallel variable distribution framework for solving optimization problems (PVD), the variables are distributed among parallel processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining “secondary” variables to change in a restricted fashion along some easily computable directions. For constrained nonlinear programs c...
The establishment and growth of an early Australian entrepreneurial firm supplying veterinary services and products is examined. John Pottie established a veterinary practice in Sydney in the 1860's and then proceeded to develop a large and successful family business that is still trading. By exploring the ingredients for its successful entry and growth, this study seeks to show through one lon...
Information Technology (IT) has significant impact on organisation’s success or failure. However, IT does not operate in a vacuum. It is influenced by non-technical factors, such as of human actions and structure, which are inseparable. Hence the relationship between the factors is critical as revealed in this chapter. Structuration was applied as a lens to examine the types of structures that ...
Application frameworks for distributive computing over the Internet are generally made up of object models that are inseparable from messaging protocols. This forces developers to adopt an “all or nothing” stance when picking which distributed protocol to use. Conversely, the World Wide Web is a loosely designed distributive system which has seen rapid adoption by end users, but poor integratio...
This paper explores whether it is useful to view the fundamental ideas behind the smart city concept through the lens of the ‘Public Value Management’ (PVM) paradigm. It investigates how appropriate ICT investment in cities might be articulated and valued through the concept of PVM. In order to achieve this, it explores the core concepts found in the PVM literature, and draws key connections to...
Originally, case-based reasoning emerged from Schank's theory of dynamic memory. It has then been presented as an artiicial intelligence methodology for processing empirical knowledge. Nevertheless, more recent case-based reasoning systems study how to take advantage from theoretical knowledge to process empirical knowledge more eeectively. In order to reach this goal, they propose memory model...
Abstract Genetic Programming (GP) is a popular and powerful evolutionary optimization algorithm that has wide range of applications such as symbolic regression, classification program synthesis. However, existing GPs often ignore the intrinsic structure ground truth equation regression problem. To improve search efficacy GP on problems by fully exploiting information, this paper proposes geneti...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید