On the lexicographic centre of multiple objective optimization
From MaRDI portal
Publication:274101
DOI10.1007/s10957-015-0810-0zbMath1338.49069OpenAlexW2177546144MaRDI QIDQ274101
Publication date: 22 April 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0810-0
lexicographic orderpolynomial-time algorithmefficient solutionimage setlexicographic centremultiple objective optimization
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The nucleolus of a standard tree game revisited: a study of its monotonicity and computational properties
- Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs
- Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures
- The nucleolus of balanced simple flow networks
- A dual-based algorithm for solving lexicographic multiple objective programs
- The nucleolus of trees with revenues
- Linear and nonlinear programming.
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
- A simplex based algorithm for the lexicographically extended linear maxmin problem
- A lexicographic minimax algorithm for multiperiod resource allocation
- Lexicographic optimality in the multiple objective linear programming: The nucleolar solution
- On the lexicographic minimax approach to location problems
- The nucleolus is contested-garment-consistent: A direct proof
- Equitable aggregations and multiple criteria analysis
- Beam selection in radiotherapy design
- On Direct Methods for Lexicographic Min-Max Optimization
- Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts
- A procedure for finding the nucleolus of a cooperativen person game
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- Computing the Nucleolus by Solving a Prolonged Simplex Algorithm
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- The Nucleolus of a Characteristic Function Game
This page was built for publication: On the lexicographic centre of multiple objective optimization