On inventory system with random lead time and repeated demands.
On scheduling models.
On second–order Taylor expansion of critical values
Studying a critical value function in parametric nonlinear programming, we recall conditions guaranteeing that is a function and derive second order Taylor expansion formulas including second-order terms in the form of certain generalized derivatives of . Several specializations and applications are discussed. These results are understood as supplements to the well–developed theory of first- and second-order directional differentiability of the optimal value function in parametric optimization....
On selecting the most reliable components.
On self-optimizing control of Markov processes
On semidefinite bounds for maximization of a non-convex quadratic objective over the l1 unit ball
We consider the non-convex quadratic maximization problem subject to the l1 unit ball constraint. The nature of the l1 norm structure makes this problem extremely hard to analyze, and as a consequence, the same difficulties are encountered when trying to build suitable approximations for this problem by some tractable convex counterpart formulations. We explore some properties of this problem, derive SDP-like relaxations and raise open questions.
On Shapley KKMS theorem
On smoothing of parametric minimax-functions and generalized max-functions via regularization.
On Solving Stochastic MADM Problems
On Solving the Maximum Betweenness Problem Using Genetic Algorithms
In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those...
On some Aspects of the Matrix Data Perturbation in Linear Program
On some integral inequalities related with the multicommodity inventory model
On some Interconnections Between Combinatorial Optimization and Extremal Graph Theory
On some limit properties of the reward from a Markov replacement process
On some polynomial solvable cases of the generalized minimum spanning tree problem.
On some properties of paramonotone operators.
On some queue length controlled stochastic processes.
On some sufficient optimality conditions in multiobjective differentiable programming
On sparsity of approximate solutions to max-plus linear systems
When a system of one-sided max-plus linear equations is inconsistent, the approximate solutions within an admissible error bound may be desired instead, particularly with some sparsity property. It is demonstrated in this paper that obtaining the sparsest approximate solution within a given error bound may be transformed in polynomial time into the set covering problem, which is known to be NP-hard. Besides, the problem of obtaining the sparsest approximate solution within a given error bound...
On Stability in Quasiconvex Semi-Infinite Optimization