Optimality and duality for minimax fractional programming with support functions under B-(p,r)-Type I assumptions
In the paper, we consider generalized minimax fractional programming with support functions. We prove optimality conditions for such nonsmooth optimization problems and Schaible, Weir and Bector type weak, strong, converse and strictly converse duality ...
C-efficiency in nondifferentiable vector optimization
We study the minimal solutions in a nondifferentiable multiobjective problem, using a relation induced by a cone C, that is C-efficient and C-weakly efficient solutions. First of all, a new class of nondifferentiable vector functions, named (C"1,C"2)-...
A continuous review (s,Q) inventory system with priority customers and arbitrarily distributed lead times
In this article we analyze a lost sales (s,Q) inventory system with two types of customers and stochastic lead times. Demands from each type of customer arrive according to two independent Poisson processes. A comparative study of the average cost rate ...
On subclasses of n-p-valent prestarlike functions of order β and type γ
In the present paper, we introduce the class R"p","n[@a,@b,@c,A,B] of n-p-valent @a-prestarlike functions of order @b and type @c with negative coefficients defined by a Salagean operator. Extreme points, integral operators and distortion theorems of ...
Duality for a class of symmetric nondifferentiable multiobjective fractional variational problems with generalized (F,α ,ρ,d)-convexity
A pair of nondifferentiable symmetric dual problems for a class of multiobjective fractional variational programs over arbitrary cones is formulated. Weak, strong and converse duality relations are then proved under generalized (F,@a,@r,d)-convexity ...
Queue size distribution and capacity optimum design for N-policy G eo(λ1,λ2,λ3)/G/1 queue with setup time and variable input rate
In this paper we consider a discrete-time Geo/G/1 queue with N-policy and setup time, where the customers' input rate varies according to the server's status: idle, setup and busy states. By using the total probability decomposition technique, we study ...
