A comment on “Level set algorithm for solving convex multiplicative programming problems”

作者：

Highlights：

•

摘要

This note provides two counterexamples to illustrate that Theorems 2.2 and 2.4 which are proposed by Ebrahim A. Youness in the above referenced paper are incorrect, respectively. Then we correct Theorems 2.2 and 2.4 to the contention.

论文关键词：Level set,Multiplicative programming,Optimal solution

论文评审过程：Available online 11 June 2008.

论文官网地址：https://doi.org/10.1016/j.amc.2008.05.143