A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
From MaRDI portal
Publication:1670109
DOI10.1007/S10957-018-1289-2zbMATH Open1394.90509OpenAlexW2800805097MaRDI QIDQ1670109FDOQ1670109
Authors: Fereshteh Akbari, M. Ghaznavi, Esmaile Khorram 
Publication date: 4 September 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1289-2
Recommendations
- The Pascoletti-Serafini scalarization scheme for multiobjective optimization problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- Modification of some scalarization approaches for multiobjective optimization
- A combined scalarizing method for multiobjective programming problems
multiobjective programmingscalarization techniqueproperly efficient solutionPascoletti-Serafini method
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Theory of multiobjective optimization
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Multicriteria Optimization
- Scalarizing vector optimization problems
- Proper efficiency and the theory of vector maximization
- Multi-objective optimization using evolutionary algorithms
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Lipschitz properties of the scalarization function and applications
- Title not available (Why is that?)
- Multiobjective optimization. Interactive and evolutionary approaches
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Evolutionary Algorithms for Solving Multi-Objective Problems
- Sensitivity analysis on the priority of the objective functions in lexicographic multiple objective linear programs
- An improved definition of proper efficiency for vector maximization with respect to cones
- Efficient solutions and bounds on tradeoffs
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs
- Characterizing ϵ-properly efficient solutions
- Proper Efficient Points for Maximizations with Respect to Cones
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- An MCDM approach to portfolio optimization.
- A combined scalarizing method for multiobjective programming problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- On improving normal boundary intersection method for generation of Pareto frontier
- Approximating the nondominated set of an MOLP by approximately solving its dual problem
- Continuous dependence of solutions on a parameter in a scalarization method
- Optimization of rod antennas of mobile phones
- An equivalent transformation of multi-objective optimization problems
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
- An optimization modelling for string selection in molecular biology using Pareto optimality
- Stochastic method for the solution of unconstrained vector optimization problems
- Geoffrion type characterization of higher-order properly efficient points in vector optimization
- Approximation of the efficient point set by perturbation of the ordering cone
- Tradeoff analysis in minimum volume design of multi-stage spur gear reduction units
- Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
- Restricting the parameter set of the Pascoletti-Serafini scalarization
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Proper minimal points of nonconvex sets in Banach spaces in terms of the limiting normal cone
Cited In (8)
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
- A combined scalarization method for multi-objective optimization problems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- A trust-region interior-point technique to solve multi-objective optimization problems and its application to a tuberculosis optimal control problem
- A modified direction approach for proper efficiency of multiobjective optimization
- Modification of some scalarization approaches for multiobjective optimization
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
Uses Software
This page was built for publication: A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670109)
