A dual-based algorithm for solving lexicographic multiple objective programs
From MaRDI portal
Publication:853009
DOI10.1016/j.ejor.2005.10.046zbMath1102.90063OpenAlexW2059083350MaRDI QIDQ853009
Masoud Zarepisheh, Latif Pourkarimi
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.10.046
Related Items
On the lexicographic centre of multiple objective optimization, Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded, A multiobjective based approach for mathematical programs with linear flexible constraints, Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs, Efficient curve fitting: an application of multiobjective programming, On the transformation of lexicographic nonlinear multiobjective programs to single objective programs, Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm, An optimization modelling for string selection in molecular biology using Pareto optimality, On some multiobjective optimization problems arising in biology, Lexicographic maximin optimisation for fair bandwidth allocation in computer networks, A triangular type-2 multi-objective linear programming model and a solution strategy, Extension of Zoutendijk method for solving constrained multiobjective optimization problems, Lagrangian duality for multiobjective programming problems in lexicographic order, A minimax theorem for vector-valued functions in lexicographic order, Determining maximal efficient faces in multiobjective linear programming problem, Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
Cites Work
