Fast Hybrid Computer Implementation of the Dynostat Algorithm
- 1 August 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (8) , 872-880
- https://doi.org/10.1109/tc.1972.5009043
Abstract
In optimal resource allocation problems the Dynostat algorithm separates the overall optimization task into less complicated optimum seeking techniques working in parallel. A hybrid computer implementation is shown to provide a much faster optimizer than was previously the case using a digital computer. Solution accuracies are considered adequate for many practical applications. The improved formulation presented of gradient search is advantageous for high-speed optimization. Confidence is increased in analog computer solutions by introducing auxiliary algorithms that check on solution feasibility and also improve accuracy.Keywords
This publication has 6 references indexed in Scilit:
- A Parallel Optimum Seeking Technique-DynostatIEEE Transactions on Systems Science and Cybernetics, 1970
- Computer control in pulp and paper 1961-1969Proceedings of the IEEE, 1970
- Optimization Problems: Solution by an Analogue ComputerThe Computer Journal, 1961
- Decomposition Principle for Linear ProgramsOperations Research, 1960
- Linear programming on an electronic analogue computerTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1956
- An Analog Solution of Programming ProblemsJournal of the Operations Research Society of America, 1955