Multiobjective Programming and Weighting Scalar Problem
Abstract
In this work is discussed the paper by Osuna-Gomez, Beato-Moreno and Rufian-Lizana, Generalized convexity in multiobjective programming: J. Math. Anal. Appl., v. 233 (1999) pp. 205--220. We point out an error in the proofs of main Theorems 2.4 and 3.6 in this reference. Then we derive correct proofs, which are based on a different approach, because the scheme of the proofs of the authors is not applicable. As a result of the discussion two additional theorems are obtained such that the scheme of the proofs of Theorems 2.4 and 3.6 in the mentioned reference works for them.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.