/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Introduction to linear and nonlinear programming

Remaining useful life estimation - A review on the statistical data driven approaches

A survey of maintenance policies of deteriorating systems

/pdf/sequencing-and-scheduling-algorithms-and-complexity-lnutyrr3kz.pdf

Sequencing and scheduling: algorithms and complexity

https://repub.eur.nl/pub/1068/ERS%202003-085-LIS.pdf

Equilibrium constrained optimization problems

A weiszfeld method for a generalized lp distance minisum location model in continuous space

The joint replenishment problem with variable production costs

This paper proposes a deep cut version of the ellipsoid algorithm for solving a general class of continuous convex programming problems. In each step the algorithm does not require more computational effort to construct these deep cuts than its corresponding central cut version. Rules that prevent some of the numerical instabilities and theoretical drawbacks usually associated with the algorithm are also provided. Moreover, for a large class of convex programs a simple proof of its rate of convergence is given and the relation with previously known results is discussed. Finally some computational results of the deep and central cut version of the algorithm applied to a min--max stochastic queue location problem are reported.

/pdf/a-deep-cut-ellipsoid-algorithm-for-convex-programming-theory-4ltr24il45.pdf

J. B. G. Frenk

Papers

Equilibrium constrained optimization problems

A weiszfeld method for a generalized lp distance minisum location model in continuous space

The joint replenishment problem with variable production costs

A deep cut ellipsoid algorithm for convex programming: theory and applications

A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering