67 citations · 115 across the 12 of their papers we have counts for
13 papers
Algorithms for DC Programming via Polyhedral Approximations of Convex Functions
Fahaar Mansoor Pirani, Firdevs Ulus
There is an existing exact algorithm that solves DC programming problems if one component of the DC function is polyhedral convex (Loehne, Wagner, 2017). Motivated by this, first,…
Computing the recession cone of a convex upper image via convex projection
Gabriela Kováčová, Firdevs Ulus
It is possible to solve unbounded convex vector optimization problems (CVOPs) in two phases: (1) computing or approximating the recession cone of the upper image and (2) solving th…
Convergence analysis of a norm minimization-based convex vector optimization algorithm
Çağın Ararat, Firdevs Ulus, Muhammad Umer
In this work, we propose an outer approximation algorithm for solving bounded convex vector optimization problems (CVOPs). The scalarization model solved iteratively within the alg…
Algorithms to solve unbounded convex vector optimization problems
Andrea Wagner, Firdevs Ulus, Birgit Rudloff +2
This paper is concerned with solution algorithms for general convex vector optimization problems (CVOPs). So far, solution concepts and approximation algorithms for solving CVOPs e…
Outer approximation algorithms for convex vector optimization problems
Irem Nur Keskin, Firdevs Ulus
In this study, we present a general framework of outer approximation algorithms to solve convex vector optimization problems, in which the Pascoletti-Serafini (PS) scalarization is…
Geometric duality results and approximation algorithms for convex vector optimization problems
Çağın Ararat, Simay Tekgül, Firdevs Ulus
We study geometric duality for convex vector optimization problems. For a primal problem with a -dimensional objective space, we formulate a dual problem with a -dimensio…
A norm minimization-based convex vector optimization algorithm
Çağın Ararat, Firdevs Ulus, Muhammad Umer
We propose an algorithm to generate inner and outer polyhedral approximations to the upper image of a bounded convex vector optimization problem. It is an outer approximation algor…
An Iterative Vertex Enumeration Method for Objective Space Based Vector Optimization Algorithms
Irfan Caner Kaya, Firdevs Ulus
An application area of vertex enumeration problem (VEP) is the usage within objective space based linear/convex {vector} optimization algorithms whose aim is to generate (an approx…
An exact algorithm for biobjective integer programming problems
Saliha Doğan, Özlem Karsu, Firdevs Ulus
We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research. The algorithm is based on solving Pa…
Certainty Equivalent and Utility Indifference Pricing for Incomplete Preferences via Convex Vector Optimization
Birgit Rudloff, Firdevs Ulus
For incomplete preference relations that are represented by multiple priors and/or multiple -- possibly multivariate -- utility functions, we define a certainty equivalent as well…
Tractability of Convex Vector Optimization Problems in the Sense of Polyhedral Approximations
Firdevs Ulus
There are different solution concepts for convex vector optimization problems (CVOPs) and a recent one, which is motivated from a set optimization point of view, consists of finite…
A Parametric Simplex Algorithm for Linear Vector Optimization Problems
Birgit Rudloff, Firdevs Ulus, Robert Vanderbei
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective s…
Primal and Dual Approximation Algorithms for Convex Vector Optimization Problems
Andreas Löhne, Birgit Rudloff, Firdevs Ulus
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The…