scientific article; zbMATH DE number 3848995
The following problem is considered: \[ F(z)=\sum^{n}_{j=1}\frac{k_ j}{1-z_ j}\to \min \] \[ \text{ subject to }\sum^{n}_{j=1}a_{ij}z_ j=b_ i,\quad i=1,...,m,\quad 0\leq z_ j\leq 0.9,\quad j=1,...,n \] where \(k_ j>0\). Using the estimate \[ 9.1\sum^{n}_{j=1}k_ j+\sum^{n}_{j=1}k_ jz_ j\geq F(z)\geq \sum^{n}_{j=1}k_ jz_ j+\sum^{n}_{j=1}k_ j \] for feasible vectors z, the author claims that ``obviously, if we minimize \(L(z) = \sum^{n}_{j=1}k_ j z_ j\) then every improvement of the value of \(L(z)\) will lead to an improvement of the value of \(F(z)\), which is, obviously, only true in particular cases.
- scientific article; zbMATH DE number 1810237 (Why is no real title available?)
- scientific article; zbMATH DE number 3845318 (Why is no real title available?)
- scientific article; zbMATH DE number 3944661 (Why is no real title available?)
- scientific article; zbMATH DE number 1145222 (Why is no real title available?)
- scientific article; zbMATH DE number 1984102 (Why is no real title available?)
- A multifactor problem of non-linear programming with a decreasing input function
- scientific article; zbMATH DE number 3894848 (Why is no real title available?)
- scientific article; zbMATH DE number 3315797 (Why is no real title available?)
- scientific article; zbMATH DE number 4185404 (Why is no real title available?)
- Nonlinear programming problem with variable coefficients and a linearization method
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 Q3318564)