S.I. Birbil (Ilker)
http://repub.eur.nl/ppl/2350/
List of Publicationsenhttp://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryOn the Economic Order Quantity Model With Transportation Costs
http://repub.eur.nl/pub/16675/
Wed, 09 Sep 2009 00:00:01 GMT<div>S.I. Birbil</div><div>K. Bulbul</div><div>J.B.G. Frenk</div><div>H.M. Mulder</div>
We consider an economic order quantity type model with unit out-of-pocket holding costs, unit
opportunity costs of holding, fixed ordering costs and general transportation costs. For these models, we analyze
the associated optimization problem and derive an easy procedure for determining a bounded interval containing
the optimal cycle length. Also for a special class of transportation functions, like the carload discount schedule, we
specialize these results and give fast and easy algorithms to calculate the optimal lot size and the corresponding
optimal order-up-to-level.The Role of Robust Optimization in Single-Leg Airline Revenue Management
http://repub.eur.nl/pub/16323/
Thu, 01 Jan 2009 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>J.A.S. Gromicho</div><div>J. Zhang</div>
In this paper, we introduce robust versions of the classical static and dynamic single-leg seat allocation models. These robust models take into account the inaccurate estimates of the underlying probability distributions. As observed by simulation experiments, it turns out that for these robust versions the variability compared to their classical counterparts is considerably reduced with a negligible decrease in average revenue.Risk measures and their applications in asset management
http://repub.eur.nl/pub/13050/
Thu, 21 Aug 2008 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>B. Kaynar</div><div>N. N. Nilay</div>
Several approaches exist to model decision making under risk, where risk can be broadly defined as the effect of variability of random outcomes. One of the main approaches in the practice of decision making under risk uses mean-risk models; one such well-known is the classical Markowitz model, where variance is used as risk measure. Along this line, we consider a portfolio selection problem, where the asset returns have an elliptical distribution. We mainly focus on portfolio optimization models constructing portfolios with minimal risk, provided that a prescribed expected return level is attained. In particular, we model the risk by using Value-at-Risk (VaR) and Conditional Value-at-Risk (CVaR). After reviewing the main properties of VaR and CVaR, we present short proofs to some of the well-known results. Finally, we describe a computationally efficient solution algorithm and present numerical results.An elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming
http://repub.eur.nl/pub/19255/
Sun, 01 Jul 2007 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints. The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of Farkas lemma and the Bolzano-Weierstrass property for compact sets.Application of a General Risk Management Model to Portfolio Optimization Problems with Elliptical Distributed Returns for Risk Neutral and Risk Averse Decision Makers
http://repub.eur.nl/pub/10151/
Thu, 24 May 2007 00:00:01 GMT<div>B. Kaynar</div><div>S.I. Birbil</div><div>J.B.G. Frenk</div>
In this paper portfolio problems with linear loss functions and multivariate elliptical distributed returns are studied. We consider two risk measures, Value-at-Risk and Conditional-Value-at-Risk, and two types of decision makers, risk neutral and risk averse. For Value-at-Risk, we show that the optimal solution does not change with the type of decision maker. However, this observation is not true for Conditional-Value-at-Risk. We then show for Conditional-Value-at-Risk that the objective function can be approximated by Monte Carlo simulation using only a univariate distribution. To solve the equivalent Markowitz model, we modify and implement a finite step algorithm. Finally, a numerical study is conducted.A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs
http://repub.eur.nl/pub/19256/
Wed, 16 May 2007 00:00:01 GMT<div>Z.P. Bayindir</div><div>S.I. Birbil</div><div>J.B.G. Frenk</div>
We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.Application of a general risk management model to portfolio optimization problems with elliptical distributed returns for risk neutral and risk averse decision makers.
http://repub.eur.nl/pub/9412/
Wed, 28 Mar 2007 00:00:01 GMT<div>B. Kaynar</div><div>S.I. Birbil</div><div>J.B.G. Frenk</div>
We discuss a class of risk measures for portfolio optimization with linear loss functions, where the random returns of financial instruments have a multivariate elliptical distribution. Under this setting we pay special attention to two risk measures, Value-at-Risk and Conditional-Value-at-Risk and differentiate between risk neutral and risk averse decision makers. When the so-called disutility function is taken as the identity function, the optimization problem is solved for a risk neutral investor. In this case, the optimal solutions of the two portfolio problems using the Value-at-Risk and Conditional-Value-at-Risk measures are the same as the solution of the classical Markowitz model. We adapt an existing less known finite algorithm to solve the Markowitz model. Its application within finance seems to be new and outperforms the standard quadratic programming procedure quadprog within MATLAB. When the disutility function is taken as a convex increasing function, the problem at hand is associated with a risk averse investor. If the Value-at-Risk is the choice of measure we show that the optimal solution does not differ from the risk neutral case. However, when Conditional-Value-at-Risk is preferred for the risk averse decision maker, the corresponding portfolio problem has a different optimal solution. In this case the used objective function can be easily approximated by Monte Carlo simulation. For the actual solution of the Markowitz model, we modify and implement the less known finite step algorithm and explain its core idea. After that we present numerical results to illustrate the effects of two disutility functions as well as to examine the convergence behavior of the Monte Carlo estimation approach.The joint replenishment problem with variable production costs
http://repub.eur.nl/pub/71013/
Thu, 16 Nov 2006 00:00:01 GMT<div>Z.P. Bayindir</div><div>S.I. Birbil</div><div>J.B.G. Frenk</div>
This paper discusses an approach to solve the joint replenishment problem in a production environment with variable production cost. These variable production costs occur due to economies of scale in production. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex analysis. Consequently, an effective and exact solution procedure is proposed. The proposed procedure is guaranteed to return a solution with a predetermined quality in terms of the objective function value. A computational study is provided to illustrate the performance of the proposed solution procedure with respect to the running time.An Integrated Approach to Single-Leg Airline Revenue Management: The Role of Robust Optimization
http://repub.eur.nl/pub/7808/
Sat, 10 Jun 2006 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>J.A.S. Gromicho</div><div>S. Zhang</div>
In this paper we introduce robust versions of the classical static and dynamic single leg seat allocation models as analyzed by Wollmer, and Lautenbacher and Stidham, respectively. These robust models take into account the inaccurate estimates of the underlying probability distributions. As observed by simulation experiments it turns out that for these robust versions the variability compared to their classical counter parts is considerably reduced with a negligible decrease of average revenue.An integrated approach to single-leg airline revenue management: The role of robust optimization
http://repub.eur.nl/pub/7755/
Thu, 11 May 2006 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>J.A.S. Gromicho</div><div>S. Zhang</div>
In this paper we introduce robust versions of the classical static
and dynamic single leg seat allocation models as analyzed by
Wollmer, and Lautenbacher and Stidham, respectively. These robust
models take into account the inaccurate estimates of the underlying
probability distributions. As observed by simulation experiments it
turns out that for these robust versions the variability compared to
their classical counter parts is considerably reduced with a
negligible decrease of average revenue.Equilibrium constrained optimization problems
http://repub.eur.nl/pub/19277/
Thu, 16 Mar 2006 00:00:01 GMT<div>S.I. Birbil</div><div>G. Bouza</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topological and analytical structure of the feasible set. Alternative formulations of an equilibrium constrained optimization problem (ECOP) that are suitable for numerical purposes are also given. As an important first step for developing efficient algorithms, we provide a genericity analysis for the feasible set of a particular ECOP, for which all the functions are assumed to be linear.An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
http://repub.eur.nl/pub/7030/
Mon, 07 Nov 2005 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints.The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of
Farkas lemma and the Bolzano-Weierstrass property for compact sets.An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming
http://repub.eur.nl/pub/6992/
Fri, 14 Oct 2005 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints. The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of Farkas lemma and the Bolzano-Weierstrass property for compact sets.Recursive approximation of the high dimensional max function
http://repub.eur.nl/pub/73920/
Thu, 01 Sep 2005 00:00:01 GMT<div>S.I. Birbil</div><div>S.-C. Fang</div><div>J.B.G. Frenk</div><div>J. Zhang</div>
This paper proposes a smoothing method for the general n-dimensional max function, based on a recursive extension of smoothing functions for the two-dimensional max function. A theoretical framework is introduced, and some applications are discussed. Finally, a numerical comparison with a well-known smoothing method is presented.An entropic regularization approach for mathematical programs with equilibrium constraints
http://repub.eur.nl/pub/62138/
Mon, 01 Nov 2004 00:00:01 GMT<div>S.I. Birbil</div><div>S-C. Fang</div><div>J. Han</div>
A new smoothing approach based on entropic regularization is proposed for solving a mathematical program with equilibrium constraints (MPEC). With some known smoothing properties of the entropy function and keeping real practice in mind, we reformulate an MPEC problem as a smooth nonlinear programming problem. In this way, a difficult MPEC problem becomes solvable by using available nonlinear optimization software. To support our claims, we use an online solver and test the performance of the proposed approach on a set of well-known test problems.On the convergence of a population-based global optimization algorithm
http://repub.eur.nl/pub/66129/
Mon, 01 Nov 2004 00:00:01 GMT<div>S.I. Birbil</div><div>S-C. Fang</div><div>R.-L. Sheu</div>
In global optimization, a typical population-based stochastic search method works on a set of sample points from the feasible region. In this paper, we study a recently proposed method of this sort. The method utilizes an attraction-repulsion mechanism to move sample points toward optimality and is thus referred to as electromagnetism-like method (EM). The computational results showed that EM is robust in practice, so we further investigate the theoretical structure. After reviewing the original method, we present some necessary modifications for the convergence proof. We show that in the limit, the modified method converges to the vicinity of global optimum with probability one.A Multi-Item Inventory Model With Joint Setup And Concave Production Costs
http://repub.eur.nl/pub/1535/
Mon, 30 Aug 2004 00:00:01 GMT<div>Z.P. Bayindir</div><div>S.I. Birbil</div><div>J.B.G. Frenk</div>
The present paper discusses an approach to solve the joint replenishment problem in a production environment with concave production cost functions. Under this environment, the model leads to a global optimization problem, which is investigated by using some standard results from convex analysis. Consequently, an effective solution procedure is proposed. The proposed procedure is guaranteed to return a solution with a predetermined quality in terms of the objective function value. A computational study is provided to illustrate the performance of the proposed solution procedure with respect to the running time.A Deterministic Inventory/Production Model with General Inventory Cost Rate Function and Concave Production Costs
http://repub.eur.nl/pub/1536/
Mon, 30 Aug 2004 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>Z.P. Bayindir</div>
We present a thorough analysis of the economic order quantity model with shortages under a general inventory cost rate function and concave production costs. By using some standard results from convex analysis, we show that the model exhibits a composite concave-convex structure. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.Generalized Fractional Programming With User Interaction
http://repub.eur.nl/pub/1325/
Mon, 21 Jun 2004 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>S. Zhang</div>
The present paper proposes a new approach to solve generalized fractional programming problems through user interaction. Capitalizing on two alternatives, we review the Dinkelbach-type methods and set forth the main difficulty in applying these methods. In order to cope with this difficulty, we propose an approximation approach that can be controlled by a predetermined parameter. The proposed approach is promising particularly when a decision maker is involved in the solution process and agrees upon finding an effective but nearoptimal value in an efficient manner. The decision maker is asked to decide the parameter and our analysis shows how good is the value found by the approximation corresponding to this parameter. In addition, we present several observations that may be suitable for boosting up the performance of the proposed approach. Finally, we support our discussion through extensive numerical experiments.Simulation-based solution of stochastic mathematical programs with complementarity constraints: Sample-path analysis
http://repub.eur.nl/pub/1164/
Wed, 18 Feb 2004 00:00:01 GMT<div>S.I. Birbil</div><div>G. Gürkan</div><div>O. Listeş</div>
We consider a class of stochastic mathematical programs with complementarity constraints, in which both the objective and the constraints involve limit functions or expectations that need to be estimated or approximated. Such programs can be used for modeling \\average" or steady-state behavior of complex stochastic systems. Recently, simulation-based methods have been successfully used for solving challenging stochastic optimization problems and equilibrium models. Here we broaden the applicability of so-called the sample-path method to include the solution of certain stochastic mathematical programs with equilibrium constraints. The convergence analysis of sample-path methods rely heavily on stability conditions. We first review necessary sensitivity results, then describe the method, and provide sufficient conditions for its almost-sure convergence. Alongside we provide a complementary sensitivity result for the corresponding deterministic problems. In addition, we also provide a unifying discussion on alternative set of sufficient conditions, derive a complementary result regarding the analysis of stochastic variational inequalities, and prove the equivalence of two different regularity conditions.