Extension of Zoutendijk method for solving constrained multiobjective optimization problems
type: Item
instance of: scholarly article
title: Extension of Zoutendijk method for solving constrained multiobjective optimization problems
zbMATH Open document ID: 1403.90614
author: Vahid Morovati
author: L. Pourkarimi
published in: European Journal of Operational Research
publication date: 2018-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6968127
zbMATH Keywords: multiple objective programming
zbMATH Keywords: Zoutendijk's method
zbMATH Keywords: nonparametric methods
zbMATH Keywords: efficient solution
zbMATH Keywords: nondominated point
describes a project that uses: NBI
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.08.018
OpenAlex ID: W2888660379
cites work: A modified Quasi-Newton method for vector optimization problem
cites work: A relaxed projection method for solving multiobjective optimization problems
cites work: Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Q5701623
cites work: Benchmarking optimization software with performance profiles.
cites work: A projected gradient method for vector optimization problems
cites work: A steepest descent method for vector optimization
cites work: Multicriteria Optimization
cites work: Adaptive Scalarization Methods in Multiobjective Optimization
cites work: Newton's Method for Multiobjective Optimization
cites work: Steepest descent methods for multicriteria optimization.
cites work: A method for constrained multiobjective optimization based on SQP techniques
cites work: Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
cites work: Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Quasi-Newton methods for multiobjective optimization problems
cites work: Barzilai and Borwein's method for multiobjective optimization problems
cites work: A dual-based algorithm for solving lexicographic multiple objective programs
cites work: Quasi-Newton's method for multiobjective optimization
cites work: Quasi-Newton methods for solving multiobjective optimization
cites work: Trust region methods for solving multiobjective optimisation
cites work: Nonmonotone gradient methods for vector optimization with a portfolio optimization application
cites work: A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
cites work: Q2945927
cites work: Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
cites work: A trust-region method for unconstrained multiobjective problems with applications in satisficing processes
Wikidata QID: Q129347518
DOI: 10.1016/J.EJOR.2018.08.018
description: scientific article; zbMATH DE number 6968127