On a variant of lexicographic multi-objective programming

DOI10.1016/S0377-2217(97)00207-5zbMath0943.90064WikidataQ127632442 ScholiaQ127632442MaRDI QIDQ1296132

Jayaram K. Sankaran

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

multicriteria analysislexicographic optimizationmin-max criterionpreemptive multiple objective programming

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29)

Related Items (1)

Solution of preemptive multi-objective network design problems applying Benders decomposition method

Cites Work

• Multiobjective programming and planning
• Lexicographic bottleneck problems
• The general nucleolus and the reduced game property
• Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
• Iterative processes with nucleolar restrictions
• An algorithm for finding the nucleolus of assignment games
• A note on the nucleolus
• The Lexicographic Kernel of a Cooperative Game
• Some New Results on Compromise Solutions for Group Decision Problems
• The Nucleolus of a Characteristic Function Game
• The Nucleolus as a Solution of a Minimization Problem
• A Class of Solutions for Group Decision Problems

This page was built for publication: On a variant of lexicographic multi-objective programming