A dual-based algorithm for solving lexicographic multiple objective programs
From MaRDI portal
Publication:853009
DOI10.1016/J.EJOR.2005.10.046zbMATH Open1102.90063OpenAlexW2059083350MaRDI QIDQ853009FDOQ853009
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
Recommendations
Cites Work
Cited In (19)
- An optimization modelling for string selection in molecular biology using Pareto optimality
- On the transformation of lexicographic nonlinear multiobjective programs to single objective programs
- Extension of Zoutendijk method for solving constrained multiobjective optimization problems
- Lagrangian duality for multiobjective programming problems in lexicographic order
- On the lexicographic centre of multiple objective optimization
- Efficient solution of ordinary differential equations with a parametric lexicographic linear program embedded
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs
- Lexicographic multi-objective MPC for constrained nonlinear systems with changing objective prioritization
- Lexicographical order and duality in multiobjective programming
- An enhanced conversion scheme for lexicographic, multiobjective integer programs
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- A multiobjective based approach for mathematical programs with linear flexible constraints
- Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
- Efficient curve fitting: an application of multiobjective programming
- Determining maximal efficient faces in multiobjective linear programming problem
- On some multiobjective optimization problems arising in biology
- A triangular type-2 multi-objective linear programming model and a solution strategy
- A minimax theorem for vector-valued functions in lexicographic order
This page was built for publication: A dual-based algorithm for solving lexicographic multiple objective programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853009)