No label defined (Q3029677)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4017730
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4017730

      Statements

      0 references
      0 references
      0 references
      1985
      0 references
      algorithm
      0 references
      multi-commodity problem
      0 references
      Sufficient conditions and necessary conditions for minima
      0 references
      convergence
      0 references
      This is mainly a brief paper modifying results appearing elsewhere. It considers an algorithm for solving a multi-commodity problem of minimizing the functional \[ C(X)=\sum^{m}_{i=1}\int^{\tau}_{0}[x_ i(t)f_ i+n_ i(t)T_ i(X^ i(t))]dt \] where \(X^ i(t)=\int^{t}_{0}x_ i(t')dt'+X^ i_ 0\), \(X=\sum^{n}_{i=1}X^ i(\tau)\) with respect to the \(x_ i(t)\) and \(n_ i(t)\), where the \(T_ i\) are decreasing cost functions, on a set of the unknown argument \(\{x_ i(t),n_ i(t),A_ i(t),B_ i(t),\tau,X\}\), \(i=1,...,n\); \(\tau\in (0,\infty)\) subject to the constraints \[ 0\leq n_ i(t)\leq a_ i(X^ i(t),t)=A_ i(t)/T_ i(X^ i(t)),\quad i=1,...,n \] \[ 0\leq x_ i(t)\leq B_ i(\tau);\quad \sum^{n}_{i=1}A_ i(t)\leq A(t);\quad \sum^{n}_{i=1}B_ i(t)\leq b(t);\quad X\leq X_{\max}; \] \[ \int^{\tau}_{0}B_ i(t)dt\geq X^ i(\tau)-X^ i_ 0;\quad \int^{\tau}_{0}a_ i(X^ i(t),t)dt\geq \int^{\tau}_{0}n_ i(t)dt,\quad i=1,...,n. \] Sufficient conditions and necessary conditions for minima are given, together with a sufficient condition for the convergence of the algorithm.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references