Linear programming in the forecasting of optimal dynamic systems

From MaRDI portal





A problem is considered in the form: `Minimize \(\sum^ K_{t=1} CX(t)\)', subject to \(TX(x-1)+ UX(t)= S\) and \(A\leq X(t)\leq B\), where \(T\) and \(U\) are matrices, and \(C\), \(S\), \(A\), \(B\) are vectors. An algorithm is given which treats this as a multistage process instead of using the conventional simplex approach, with a fourfold increase in computational speed. It is applied to a real economic problem, namely date production in Saudi Arabia.











This page was built for publication: Linear programming in the forecasting of optimal dynamic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4278256)