منابع مشابه
Relaxation Methods for Monotropic Programs
We propose a finitely convergent dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to linear constraints. The method has properties reminiscent of the Gauss-Seidel method in numerical analysis. As special cases we obtain the methods in [1] for network flow programs and the methods in [14] for linear programs. *Work supported by the Na...
متن کاملRelaxation Methods for Linear Programs
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملislanding detection methods for microgrids
امروزه استفاده از منابع انرژی پراکنده کاربرد وسیعی یافته است . اگر چه این منابع بسیاری از مشکلات شبکه را حل می کنند اما زیاد شدن آنها مسائل فراوانی برای سیستم قدرت به همراه دارد . استفاده از میکروشبکه راه حلی است که علاوه بر استفاده از مزایای منابع انرژی پراکنده برخی از مشکلات ایجاد شده توسط آنها را نیز منتفی می کند . همچنین میکروشبکه ها کیفیت برق و قابلیت اطمینان تامین انرژی مشترکان را افزایش ...
15 صفحه اولThe Price of Inexactness: Convergence Properties of Relaxation Methods for Mathematical Programs with Equilibrium Constraints Revisited
Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set has a very special structure and violates most of the standard constraint qualifications. Therefore, one typically applies specialized algorithms in order to solve MPECs. One prominent class of specialized algorithms are the relaxation (or r...
متن کاملQualitative Sensitivity Analysis in Monotropic Programming
Optimal selections are parameter-dependent optimal solutions of parametric optimization problems whose properties can be used in sensitivity analysis. Here we present a qualitative theory of sensitivity analysis for linearly-constrained convex separable (i.e., monotropic) parametric optimization problems. Three qualitative sensitivity analysis results previously derived for network flows are ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1990
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01585734