Frenk J.B.G.

J.B.G. Frenk

Information about the author J.B.G. Frenk will soon be added to the site.
Found 20 papers in total
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs
2007
We present a thorough analysis of the economic production quantity model with...
A note on the paper ‘Fractional programming with convex quadratic forms and functions’ by H.P. Benson
A note on the paper ‘Fractional programming with convex quadratic forms and functions’ by H.P. Benson
2007
In this technical note, we give a short proof based on some standard results in convex...
The joint replenishment problem with variable production costs
The joint replenishment problem with variable production costs
2006
This paper discusses an approach to solve the joint replenishment problem in a...
On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory
On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory
2007
In this paper we discuss necessary and sufficient conditions for different minimax...
Equilibrium constrained optimization problems
Equilibrium constrained optimization problems
2006
We consider equilibrium constrained optimization problems, which have a general...
On equivalent results in minimax theory
On equivalent results in minimax theory
2004
In this paper we review known minimax theorems with applications in game theory and...
Modeling of inventory control with regenerative processes
Modeling of inventory control with regenerative processes
2001
In this paper we will discuss a general framework for single-item inventory models...
On the newsboy model with a cutoff transaction size
On the newsboy model with a cutoff transaction size
2000
In this paper we analyse the effect of a cutoff transaction size on the average...
An efficient algorithm for a generalized joint replenishment problem
An efficient algorithm for a generalized joint replenishment problem
1999
In most multi-item inventory systems, the ordering costs consist of a major cost and a...
An interior-point based subgradient method for nondifferentiable convex optimization
An interior-point based subgradient method for nondifferentiable convex optimization
1998
We propose in this paper an algorithm for solving linearly constrained...
An efficient optimal solution method for the joint replenishment problem
An efficient optimal solution method for the joint replenishment problem
1997
During the last two decades, many heuristic procedures for the joint replenishment...
Fractional location problems
Fractional location problems
1997
In this paper we analyze some variants of the classical uncapacitated facility...
On Miehle’s algorithm and the perturbed 97Làp-distance multifacility location problem
On Miehle’s algorithm and the perturbed 97Làp-distance multifacility location problem
1994
A generalized multifacility location problem in continuous space with distances...
A deep cut ellipsoid algorithm for convex programming: Theory and applications
A deep cut ellipsoid algorithm for convex programming: Theory and applications
1994
This paper proposes a deep cut version of the ellipsoid algorithm for solving a...
A Weiszfeld method for a generalized Lp distance minisum location model in continuous space
A Weiszfeld method for a generalized Lp distance minisum location model in continuous space
1994
A generalized minisum location model in continuous space with distances measured by...
A note on a stochastic location problem
A note on a stochastic location problem
1993
In this note the authors give a short and easy proof of the equivalence of...
The Weiszfeld method in single facility location
The Weiszfeld method in single facility location
1994
In this paper two algorithms based on the Weiszfeld method are proposed to solve the...
Labour costs and queueing theory in retailing
Labour costs and queueing theory in retailing
1991
In this paper approximation results for the M/G/ s queueing model are used to derive...
A simple proof of Liang’s lower bound for on-line packing and the extension to the parametric case
A simple proof of Liang’s lower bound for on-line packing and the extension to the parametric case
1993
In this note the authors present a simplified proof of a lower bound for on-line bin...
Single-machine scheduling subject to stochastic breakdowns
Single-machine scheduling subject to stochastic breakdowns
1990
The authors provide several examples of one-machine problems in which the minimization...
Papers per page: