A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming.

zbMATH Open1039.90523MaRDI QIDQ2721839

Zhanfeng Chen, Duan Xu

Publication date: 11 July 2001

Published in: Systems Science and Mathematical Sciences (Search for Journal in Brave)

zbMATH Keywords

multiobjective programmingmajor efficiencyefficient equivalence point set

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Recommendations

• A direct approach for finding all efficient solutions for multiobjective programming problems 👍 👎
• Major-efficient solutions and weakly major-efficient solutions of multiobjective programming 👍 👎
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems 👍 👎
• A computationally efficient algorithm for determination of efficient max-ordering optimal solutions in multiple objective programming 👍 👎
• Solving multiobjective programming problems by discrete representation 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A new method for finding major efficient solutions and major optimal solutions of discrete multiobjective programming.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2721839)