✦ LIBER ✦

Optimization of STEOR networks via Markov renewal programming

✍ Scribed by W. Nicolai

Book ID: 105399660
Publisher: Springer
Year: 1982
Tongue: English
Weight: 591 KB
Volume: 26
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01917094

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decision Horizons in Discrete Time Undis

Decision Horizons in Discrete Time Undiscounted Markov Renewal Programming

✍ Morton, Thomas E. 📂 Article 📅 1974 🏛 Institute of Electrical and Electronics Engineers ⚖ 655 KB

Existence of a solution to the Markov re

Existence of a solution to the Markov renewal programming problem

✍ L. Fulkerson; A.S.S. Dorvlo 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 97 KB

Iterative solution of the functional equ

Iterative solution of the functional equations of undiscounted Markov renewal programming

✍ Paul J Schweitzer 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 321 KB

NOVA (Network Optimization Via Adjoints)

NOVA (Network Optimization Via Adjoints) (Computer Program Descriptions)

✍ Herrick, D.L.; Field, J.C. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 226 KB

On the solvability of Bellman's function

On the solvability of Bellman's functional equations for Markov renewal programming

✍ Paul J Schweitzer 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Optimization of electrical networks usin

Optimization of electrical networks using nonlinear programming

✍ V.K. Manaktala 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 870 KB

This paper describes three methods of optimizing linear time-invariant networks using nonlinear programming (NLP), particularly the sequential unconstrained minimization technique (SUM T). Examples involving realistic constraints are included. I. Zntroduction