The set of all the possible compromises of a multi-level multi-objective linear programming problem

DOI10.17535/crorr.2022.0002zbMath1500.90065OpenAlexW4285496801MaRDI QIDQ5106105

Mustapha Kaci, Sonia Radjef

Publication date: 16 September 2022

Published in: Croatian operational research review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17535/crorr.2022.0002

zbMATH Keywords

non-dominated pointsdecision makersmulti-level multi-objective linear programmingnon-dominated extreme pointsnon-dominated facets

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (3)

A new geometric approach to multiobjective linear programming problems ⋮ Solving multi level multi-objective linear programming (ML MOLP) problems with fuzzy parameters (FPs) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• An effective generalization of the direct support method
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Multilevel decision-making: a survey
• Fuzzy approach for multi-level programming problems
• Solving multi-level multi-objective linear programming problems through fuzzy goal programming approach
• Technical Note—A Method for Solving Mathematical Programs with Nonlinear Programs in the Constraints
• Generation of efficient and ε -efficient solutions in multiple objective linear programming
• Mathematical Programs with Optimization Problems in the Constraints

This page was built for publication: The set of all the possible compromises of a multi-level multi-objective linear programming problem