In this paper, we propose a modification of Benson’s algorithm for solving multiobjective linear programmes in objective space in order to approximate the true nondominated set. We first summarize Benson’s original algorithm and propose some small changes to improve computational...

This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript> being the underlying ordering cone, called semistrictly ( [InlineMediaObject not available: see fulltext.]<Superscript> m </Superscript>\ −int...</superscript></superscript>

This paper introduces a new class of non-convex vector functions strictly larger than that of P-quasiconvexity, with P⊆ [InlineMediaObject not available: see fulltext.] m being the underlying ordering cone, called semistrictly ( [InlineMediaObject not available: see fulltext.] m \ −int...