scientific article; zbMATH DE number 3906265

From MaRDI portal
Publication:3683933





A finite polynomial threshold-type method for the solution of the following optimization problem on \(R^ m\) is suggested: \[ \| v- w\| \equiv \max_{1\leq i\leq m}| v_ i-w_ i| \to \min \] subject to \(v_ i=\max_{1\leq j\leq n_ 1}(a_{ij}+x_ j)\), \(w_ i=\max_{1\leq j\leq n_ 2}(b_{ij}+y_ j)\) \((i=1,...,m)\), \(k\leq x\leq K\), \(h\leq y\leq H\), where \(a_{ij},..\). \(b_{ij},..\). \(k_ j,..\). \(K_ j,..\). \(h_ j,..\). \(H_ j\) are given real numbers. The algorithm is explained on a general algebraic structure (G,\(\otimes,\leq)\). The connection to the solution of certain machine time scheduling problems of \textit{R. A. Cuninghame-Green} [Minimax algebra, Lect. Notes Econ. Math. Syst. 166 (1979; Zbl 0399.90052)] is discussed. If \(h=H\), the algorithm reduces to that described in a previous paper of the author [Math. Program. Study 22, 237-251 (1984; Zbl 0558.90102)].











This page was built for publication:

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