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 2 Next

Displaying 21 – 40 of 240

Showing per page

Centralized VERSUS decentralized production planning

Georgios K. Saharidis, Yves Dallery, Fikri Karaesmen (2006)

RAIRO - Operations Research

In the course of globalization, many enterprises change their strategies and are coupled in partnerships with suppliers, subcontractors and customers. This coupling forms supply chains comprising several geographically distributed production facilities. Production planning in a supply chain is a complicated and difficult task, as it has to be optimal both for the local manufacturing units and for the whole supply chain network. In this paper two analytical models are used to solve the production planning...

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge, Minghao Chen, Hiroaki Ishii (2012)

Kybernetika

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this...

Chance constrained optimal beam design: Convex reformulation and probabilistic robust design

Jakub Kůdela, Pavel Popela (2018)

Kybernetika

In this paper, we are concerned with a civil engineering application of optimization, namely the optimal design of a loaded beam. The developed optimization model includes ODE-type constraints and chance constraints. We use the finite element method (FEM) for the approximation of the ODE constraints. We derive a convex reformulation that transforms the problem into a linear one and find its analytic solution. Afterwards, we impose chance constraints on the stress and the deflection of the beam....

Chance constrained problems: penalty reformulation and performance of sample approximation technique

Martin Branda (2012)

Kybernetika

We explore reformulation of nonlinear stochastic programs with several joint chance constraints by stochastic programs with suitably chosen penalty-type objectives. We show that the two problems are asymptotically equivalent. Simpler cases with one chance constraint and particular penalty functions were studied in [6,11]. The obtained problems with penalties and with a fixed set of feasible solutions are simpler to solve and analyze then the chance constrained programs. We discuss solving both problems...

Characterization of linear rational preference structures.

Jacinto González Pachón, Sixto Ríos-Insua (1992)

Extracta Mathematicae

We consider the multiobjective decision making problem. The decision maker's (DM) impossibility to take consciously a preference or indifference attitude with regard to a pair of alternatives leads us to what we have called doubt attitude. So, the doubt may be revealed in a conscient way by the DM. However, it may appear in an inconscient way, revealing judgements about her/his attitudes which do not follow a certain logical reasoning.In this paper, doubt will be considered as a part of the information...

Characterization of optimal shapes and masses through Monge-Kantorovich equation

Guy Bouchitté, Giuseppe Buttazzo (2001)

Journal of the European Mathematical Society

We study some problems of optimal distribution of masses, and we show that they can be characterized by a suitable Monge-Kantorovich equation. In the case of scalar state functions, we show the equivalence with a mass transport problem, emphasizing its geometrical approach through geodesics. The case of elasticity, where the state function is vector valued, is also considered. In both cases some examples are presented.

Characterization of the departure process from an ME/ME/1 queue

Jayesh Kumaran, Kenneth Mitchell, Appie Van de Liefvoort (2004)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag ( k - 1 ) .

Characterization of the departure process from an ME/ME/1 queue

Jayesh Kumaran, Kenneth Mitchell, Appie van de Liefvoort (2010)

RAIRO - Operations Research

In this paper we propose a family of finite approximations for the departure process of an ME/ME/1 queue indexed by a parameter k defined as the system size of the finite approximation. The approximations capture the interdeparture times from an ME/ME/1 queue exactly and preserve the lag correlations of inter-event times of the departures from an ME/ME/1 queue up to lag (k - 1).

Characterization of the first operating period of a two-unit standby redundant system with three states of units

Antonín Lešanovský (1982)

Aplikace matematiky

A two-unit cold-standby redundant system with one repair facility is considered. Each unit can be in three states: good (I), degraded (II), and failed (III). We suppose that only the following state-transitions af a unit are possible: I → I I , I I → I I I , I I → I , I I I → I . The paper is devoted to the problems which arise only provided that the units of the redundant system can be in more than two states (i.e. in operating and failed states). The following characteristics dealing with a single operating period of the system are studied...

Characterizations of error bounds for lower semicontinuous functions on metric spaces

Dominique Azé, Jean-Noël Corvellec (2004)

ESAIM: Control, Optimisation and Calculus of Variations

Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...

Characterizations of error bounds for lower semicontinuous functions on metric spaces

Dominique Azé, Jean-Noël Corvellec (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Refining the variational method introduced in Azé et al. [Nonlinear Anal. 49 (2002) 643-670], we give characterizations of the existence of so-called global and local error bounds, for lower semicontinuous functions defined on complete metric spaces. We thus provide a systematic and synthetic approach to the subject, emphasizing the special case of convex functions defined on arbitrary Banach spaces (refining the abstract part of Azé and Corvellec [SIAM J. Optim. 12 (2002) 913-927], and the characterization...

Characterizations of the Solution Sets of Generalized Convex Minimization Problems

Ivanov, Vsevolod (2003)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 90C26, 90C20, 49J52, 47H05, 47J20.In this paper we obtain some simple characterizations of the solution sets of a pseudoconvex program and a variational inequality. Similar characterizations of the solution set of a quasiconvex quadratic program are derived. Applications of these characterizations are given.

Characterizations of ɛ-duality gap statements for constrained optimization problems

Horaţiu-Vasile Boncea, Sorin-Mihai Grad (2013)

Open Mathematics

In this paper we present different regularity conditions that equivalently characterize various ɛ-duality gap statements (with ɛ ≥ 0) for constrained optimization problems and their Lagrange and Fenchel-Lagrange duals in separated locally convex spaces, respectively. These regularity conditions are formulated by using epigraphs and ɛ-subdifferentials. When ɛ = 0 we rediscover recent results on stable strong and total duality and zero duality gap from the literature.

Currently displaying 21 – 40 of 240