The existing research on market price-affecting agents, i.e. price makers, neglects or simplifies the nature of AC power flows in system as it predominantly relies DC flows. This paper proposes a novel bilevel formulation based smoothing technique, where any strategic player can be modelled upper level, while clearing problem lower level uses convex quadratic transmission optimal flow (AC OPF),...

This study deals with the effects of a supply chain (SC) with single product, multiple retailers and a manufacturer, where the manufacturer(he) produces lotsize of the product that contains a random portion of imperfect quality item. The imperfect quality products are sold in a secondary shop. The new contribution of this paper is a new non-linear demand function. Demand of the end customers va...

Electronic patient data gives many advantages, but also new difficulties. Deadlocks may delay procedures like acquiring information. Distributed deadlock resolution solutions introduce uncertainty due to inaccurate transaction properties. Soft computing-based have been developed solve this challenge. In a single framework, ambiguous, vague, incomplete, and inconsistent attribute information has...

The purpose of this study was to evaluate the accuracy of alignment after open-wedge high tibial osteotomy and its effect on the clinical outcome. A prospective case series of 56 consecutive patients underwent open-wedge high tibial osteotomy fixed with a TomoFix plate fixator (Synthes, West Chester, Pennsylvania). The correction angle was radiologically determined preoperatively and at 6 month...

| A simple, rule-based approach to traac ow can yield astonishingly realistic results and is therefore a candidate for very fast large scale microscopic traac simulations. In the present article, we evaluate two conceptually diierent codings of the same dynamics on parallel supercomputers. We use a Parsytec GCel{3 (1024 nodes), an Intel iPSC/860 (32 nodes), and a Connection Machine CM{5 (32 nod...

In this paper, we present a simplex method for linear programs in standard form, or more precisely, linear optimization problems that have countably many non-negative variables and countably many equality constraints. Important special cases of these problems include infinite horizon deterministic dynamic programming problems and network flow problems with countably infinite nodes and arcs. Aft...

We present a randomized algorithm for sorting n keys of any abstract data type on the p processors of a practical parallel computer model that is asymptotically optimal compared to the best available sequential sorting algorithm even when constant factors are taken into consideration. We designed and analyzed the performance of the algorithm in an architecture independent setting and expressed ...

In this paper we propose a new decomposition method for large scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent. The ascent directions are chosen from a finite set and are generated by a truncated version of the painted index algorithm [13]. Central to this method is the novel notion of (e,8)co...

Seaport container terminals are source of many interesting large-scale optimization problems, which arise in the management of operations at several decision levels. In this paper we firstly illustrate a recently proposed framework, called two-stage column generation (Salani and Vacca, 2008), which is suitable for a particular class of large-scale problems, where the structure of the original f...