透過您的圖書館登入
IP:3.15.174.76
  • 期刊

A Note on One Outsourcing Scheme for Large-scale Convex Separable Programming

摘要


We show that the scheme [IEEE Trans. Big Data, 5 (3), 2019, 368{378] cannot be practically implemented because the outsourced problem is unsolvable. It confused functional constraints with nonnegativity constraints in the linear programming model. But the nonnegativity constraints are indispensable to the general simplex method. We also find the proposed transformations are awed. The client cannot use them to recover the solution to the original problem, even if the cloud introduces the necessary nonnegativity constraints by default and returns the solution to the new problem to the client.

延伸閱讀