All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 17 Next

Displaying 321 – 340 of 450

Showing per page

Production-inventory system with finite production rate, stock-dependent demand, and variable holding cost

Hesham K. Alfares (2014)

RAIRO - Operations Research - Recherche Opérationnelle

In general, traditional production-inventory systems are based on a number of simplifying – but somewhat unrealistic – assumptions, including constant demand rate, constant holding cost, and instantaneous order replenishment. These assumptions have been individually challenged in numerous variations of production-inventory models. Finite production rate models, such as economic production quantity (EPQ) systems consider gradual order replenishment. Stock-dependent demand models assume the demand...

Random perturbation of the variable metric method for unconstrained nonsmooth nonconvex optimization

Abdelkrim El Mouatasim, Rachid Ellaia, José Souza de Cursi (2006)

International Journal of Applied Mathematics and Computer Science

We consider the global optimization of a nonsmooth (nondifferentiable) nonconvex real function. We introduce a variable metric descent method adapted to nonsmooth situations, which is modified by the incorporation of suitable random perturbations. Convergence to a global minimum is established and a simple method for the generation of suitable perturbations is introduced. An algorithm is proposed and numerical results are presented, showing that the method is computationally effective and stable....

Reformulations in Mathematical Programming: Definitions and Systematics

Leo Liberti (2009)

RAIRO - Operations Research

A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts to move...

Regularization in state space

G. Chavent, K. Kunisch (1993)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Regularization method for stochastic mathematical programs with complementarity constraints

Gui-Hua Lin, Masao Fukushima (2005)

ESAIM: Control, Optimisation and Calculus of Variations

In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We also show that such an accumulation point is S-stationary to the problem under additional assumptions.

Regularization method for stochastic mathematical programs with complementarity constraints

Gui-Hua Lin, Masao Fukushima (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We also show that such an accumulation point is S-stationary to the problem under additional assumptions....

Relations between multidimensional interval-valued variational problems and variational inequalities

Anurag Jayswal, Ayushi Baranwal (2022)

Kybernetika

In this paper, we introduce a new class of variational inequality with its weak and split forms to obtain an L U -optimal solution to the multi-dimensional interval-valued variational problem, which is a wider class of interval-valued programming problem in operations research. Using the concept of (strict) L U -convexity over the involved interval-valued functionals, we establish equivalence relationships between the solutions of variational inequalities and the (strong) L U -optimal solutions of the multi-dimensional...

Currently displaying 321 – 340 of 450