نتایج جستجو برای: linear programming lp
تعداد نتایج: 781014 فیلتر نتایج به سال:
We study the linear programming (LP) approach to approximate dynamic programming (DP) through experiments with the game of Tetris. Our empirical results suggest that the performance of policies generated by the approach is highly sensitive to how the problem is formulated and the discount factor. Furthermore, we find that, using a state-sampling scheme of the kind proposed in [7], the simulatio...
سابقه و هدف: برنامهریزی خطی LP (Linear Programming) راهی آسان برای بهینهسازی هزینه غذا به صورتی است که مواد مغذی نیز تأمین شود. هدف از این مطالعه، اجرای LP به منظور طراحی یک وعده غذایی برای بیماران کلیوی به نحوی است که تمامی نیازهای اساسی تأمین شود و هزینه غذا نیز به حداقل ممکن برسد. مواد و روشها: دو نوع غذای ترکیبی (شامل چلوخورش قورمهسبزی و چلوخورش قیمه بادمجان) انتخاب و مقدار اجزای تشکیل ...
The linear programming (LP) approach has a long history in the theory of approximate dynamic programming. When it comes to computation, however, LP often suffers from poor scalability. In this work, we introduce relaxed version Bellman operator for q-functions and prove that is still monotone contraction mapping with unique fixed point. spirit approach, exploit new build program (RLP). Compared...
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte’s linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower bound on designs. Specifically, when the distance of the code is fixed and the dimension goes to infinity, the LP upper bound on codes is at least as large as ...
Existing software implementations for solving Linear Programming (LP) models are all based on full matrix inversion operations involving every constraint in the model in every step. This linear algebra component in these systems makes it difficult to solve dense models even with moderate size, and it is also the source of accumulating roundoff errors affecting the accuracy of the output. We pre...
We present a novel linear program for the approximation of the dynamic programming costto-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural ‘projection’ of a well studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go fun...
When solving families of related linear programming (LP) problems and many classes of single LP problems, the simplex method is the preferred computational technique. Hitherto there has been no efficient parallel implementation of the simplex method that gives good speed-up on general, large sparse LP problems. This paper presents a variant of the dual simplex method and a prototype parallelisa...
Maximum a-posteriori (MAP) estimation is an important task in many applications of probabilistic graphical models. Although finding an exact solution is generally intractable, approximations based on linear programming (LP) relaxation often provide good approximate solutions. In this paper we present an algorithm for solving the LP relaxation optimization problem. In order to overcome the lack ...
the fuzzy linear regression model with fuzzy input-output data andcrisp coefficients is studied in this paper. a linear programmingmodel based on goal programming is proposed to calculate theregression coefficients. in contrast with most of the previous works, theproposed model takes into account the centers of fuzzy data as animportant feature as well as their spreads in the procedure ofconstr...
We present a novel linear program for the approximation of the dynamic programming costto-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural ‘projection’ of a well studied linear program for exact dynamic programming. Such programs restrict attention to approximations that are lower bounds to the optimal cost-to-go fun...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید