On first experiences with the implementation of a Newton based linear programming approach.
Wanka, A. (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Wanka, A. (1989)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Bajalinov, E., Rácz, A. (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Stanisław Bylka (1996)
Applicationes Mathematicae
Similarity:
This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted...
Vemuganti, R.R. (2004)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Edgar A. Portilla-Flores, Maria B. Calva-Yáñez, Miguel G. Villarreal-Cervantes, Paola A. Niño Suárez, Gabriel Sepúlveda-Cervantes (2014)
Kybernetika
Similarity:
This paper presents a dynamic approach to the synthesis of a crank-rocker four-bar mechanism, that is obtained by an optimization problem and its solution using the swarm intelligence algorithm called Modified-Artificial Bee Colony (M-ABC). The proposed dynamic approach states a mono-objective dynamic optimization problem (MODOP), in order to obtain a set of optimal parameters of the system. In this MODOP, the kinematic and dynamic models of the whole system are consider as well as a...
Yue Ge, Minghao Chen, Hiroaki Ishii (2012)
Kybernetika
Similarity:
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...
Xuesong Li, Hiroaki Ishii, Minghao Chen (2012)
Kybernetika
Similarity:
A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy...