Öz
Marjinal analizin güvenilirlik redandansı optimizasyonuna bir uyarlaması anlatılmaktadır. Amaç fonksiyonu ayrışık hale dönüştürülüp, konkav olduğu gösterilecek ve marjinal analiz metodunun çok seri ve hızlı bir şekilde, optimal olmasa bile, optimala çok yakın çözümler ürettiği bir örnekle gösterilecektir.
Anahtar Kelimeler
Ayrık Konkav Kaynak Tahsisi Problemleri Marjinal Tahsis Algoritması
Kaynakça
- FOX, B. (1966), Discrete Optimization via Marginal Analysis, Management Science, 13, 210-216.
- lBARAKI, T., KATOH, N. (1988), Resource Allocation Problems, the MIT Press.
- KAO, E. (1976), On lncremental Analysis in Resource Allocations, OR Qarterly, 27, 759-763.
- KATOH, N., IBARAKI, T. (1998), Resource Arrocation Problems, D.--Z. Du, P.M. Pardalos, eds., Handbook of Combinatorial Optimization, Kluwer Academic, Boston, 159-260.
- LUENBERGER, D.G. (1973), Introduction to Linear and Nonlinear Programming, Addison-Wesley.
- MILLER, B.L. (1971), On Minimizing Nonseparable Functions defined on Integers with an Inventory Application,
- SIAM Journal of Applied Mathematics, 21/1, 166-185.
- MUROTA, K. (2003), Discrete Convex Analysis, SIAM.
- PAGES, A., GONDRAN. M. (1986), System Reliability, Springer-Verlag.
- YÜCEER, Ü. (1999), Marginal Allocation Algorithym for Nonseparable Functions, INFOR, 37, 97- 113.
- YÜCEER, Ü. (2002), Discrete Convexity: Convexity for functions defined on Discrete Spaces, Discrete Applied Mathematics, 119/3, 299-306.
- YÜCEER, Ü. (2006), The Equivalence of Discrete Convexity and the Classical Definition of Convexity, International Mathematical Forum.1/5, 299-308.
Öz
An application of marginal analysis to redundancy optimization is presented. The objective function is transformed into a separable function and its discrete concavity is proved. Consequently, the marginal allocarion algorithm obtains near optimal solutions very rapidly. An example illustrates the method.
Anahtar Kelimeler
Discrete Concavity Marginal Allocation Algorithm Resource Allocation Problems
Kaynakça
- FOX, B. (1966), Discrete Optimization via Marginal Analysis, Management Science, 13, 210-216.
- lBARAKI, T., KATOH, N. (1988), Resource Allocation Problems, the MIT Press.
- KAO, E. (1976), On lncremental Analysis in Resource Allocations, OR Qarterly, 27, 759-763.
- KATOH, N., IBARAKI, T. (1998), Resource Arrocation Problems, D.--Z. Du, P.M. Pardalos, eds., Handbook of Combinatorial Optimization, Kluwer Academic, Boston, 159-260.
- LUENBERGER, D.G. (1973), Introduction to Linear and Nonlinear Programming, Addison-Wesley.
- MILLER, B.L. (1971), On Minimizing Nonseparable Functions defined on Integers with an Inventory Application,
- SIAM Journal of Applied Mathematics, 21/1, 166-185.
- MUROTA, K. (2003), Discrete Convex Analysis, SIAM.
- PAGES, A., GONDRAN. M. (1986), System Reliability, Springer-Verlag.
- YÜCEER, Ü. (1999), Marginal Allocation Algorithym for Nonseparable Functions, INFOR, 37, 97- 113.
- YÜCEER, Ü. (2002), Discrete Convexity: Convexity for functions defined on Discrete Spaces, Discrete Applied Mathematics, 119/3, 299-306.
- YÜCEER, Ü. (2006), The Equivalence of Discrete Convexity and the Classical Definition of Convexity, International Mathematical Forum.1/5, 299-308.
Ayrıntılar
| Birincil Dil | Türkçe |
|---|---|
| Konular | İstatistik |
| Bölüm | Araştırma Makaleleri |
| Yazarlar | |
| Yayımlanma Tarihi | 15 Aralık 2005 |
| Yayımlandığı Sayı | Yıl 2005 Cilt: 4 Sayı: 3 |
