auction, decision theory, dynamic programming, algorithm In this paper we study algorithms for agents participating in multiple simultaneous auctions for a single private-value good; we use stochastic dynamic programming to derive formal methods for optimal algorithm specification; we study a number of algorithms of complementary complexity and effectiveness, and report preliminary tests on the...

The paper presents an approach for avoiding and minimizing the complementary pivots in a simplex based solution method for a quadratic programming problem. The linearization of the problem is slightly changed so that the simplex or interior point methods can solve with full speed. This is a big advantage as a complementary pivot algorithm will take roughly eight times as longer time to solve a ...

For application of the plastic analysis and design methods the control of the plastic behaviour of the structures is an important requirement. In this study, the complementary strain energy of the residual forces is considered as an overall measure of the plastic performance of the structure. Shakedown theorem for the analysis of the plastic behaviour of the laterally loaded piles is developed ...

The first algorithm to use a complementary pivoting procedure was that devised by Lemke and Howson to find a Nash equilibrium point of a bimatrix game [ 15 ]. This algorithm introduced a novel proof of convergence not relying on standard monotonicity arguments. Lemke [ 12] generalized his complementary pivot algorithm to solve certain classes of linear complementarity problem (LCP), which Dantz...

The literature in the eld of interior point methods for linear programming has been almost exclusively algorithm oriented. Recently G uler, Roos, Terlaky and Vial presented a complete duality theory for linear programming based on the interior point approach. In this paper we present a more simple approach which is based on an embedding of the primal problem and its dual into a skew symmetric ...

Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. This work is a step towards establishing the standards of performance analysis in the realm of answer set programming – a prominent constraint programming paradigm. We present and study the roles of human tuning and automatic configuration tools in this process. The case s...

Balinski and Tucker introduced in 1969 a special form of optimal tableaus for LP, which can be used to construct primal and dual optimal solutions such that the complementary slackness relation holds strictly. In this paper, first we note that using a polynomial time algorithm for LP Balinski and Tucker’s tableaus are obtainable in polynomial time. Furthermore, we show that, given a pair of pri...

abstract management of water resources in iran is faced with growing demand for water resources, a considerable increase in the costs of supplying additional water and uncontrolled exploitation of underground waters. economists suggest water pricing to improve water use efficiency; however, government tends to reject that advice due to political risk, economic and cultural concerns. we used a p...