The Nonlinear Programming Method of Wilson, Han, and Powell with an Augmented Lagrangian Type Line Search Function. Part 1 : Convergence Analysis.
The Nonlinear Programming Method of Wilson, Han, and Powell with an Augmented Lagrangian Type Line Search Function. Part 2 : An Efficient Implementation with Linear Least Squares Subproblems.
The Nonstandard Algorithm for Constructing Efficient Conjoint Experimental Designs
The Operational Flight and Multi-Crew Scheduling Problem
The Optimal Control in Batch Arrival Queue With Server Vacations, Startup and Breakdowns
The optimization of feed forward neural networks structure using genetic algorithms.
The optimization of heat radiation intensity
This article focuses on the problem of calculating the intensity of heat radiation and its optimization across the surface of an aluminium or nickel mould. The inner mould surface is sprinkled with a special PVC powder and the outer mould surface is warmed by infrared heaters located above the mould. In this way artificial leathers are produced in the car industry (e.g., the artificial leather on a car dashboard). The article includes a description of how a mathematical model allows us to calculate the...
The Orderly Colored Longest Path Problem – a survey of applications and new algorithms
A concept of an Orderly Colored Longest Path (OCLP) refers to the problem of finding the longest path in a graph whose edges are colored with a given number of colors, under the constraint that the path follows a predefined order of colors. The problem has not been widely studied in the previous literature, especially for more than two colors in the color arrangement sequence. The recent and relevant application of OCLP is related to the interpretation of Nuclear Magnetic Resonance experiments for...
The output least squares identifiability of the diffusion coefficient from an H–observation in a 2–D elliptic equation
Output least squares stability for the diffusion coefficient in an elliptic equation in dimension two is analyzed. This guarantees Lipschitz stability of the solution of the least squares formulation with respect to perturbations in the data independently of their attainability. The analysis shows the influence of the flow direction on the parameter to be estimated. A scale analysis for multi-scale resolution of the unknown parameter is provided.
The Output Least Squares Identifiability of the Diffusion Coefficient from an H1–Observation in a 2–D Elliptic Equation
Output least squares stability for the diffusion coefficient in an elliptic equation in dimension two is analyzed. This guarantees Lipschitz stability of the solution of the least squares formulation with respect to perturbations in the data independently of their attainability. The analysis shows the influence of the flow direction on the parameter to be estimated. A scale analysis for multi-scale resolution of the unknown parameter is provided.
The partial inverse minimum cut problem with L1-norm is strongly NP-hard
The partial inverse minimum cut problem is to minimally modify the capacities of a digraph such that there exists a minimum cut with respect to the new capacities that contains all arcs of a prespecified set. Orlin showed that the problem is strongly NP-hard if the amount of modification is measured by the weighted L1-norm. We prove that the problem remains hard for the unweighted case and show that the NP-hardness proof of Yang [RAIRO-Oper. Res.35 (2001) 117–126] for this problem with additional bound...
The periodic Vehicle routing problem: classification and heuristic
Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical...
The PH/M/c queue with varying environment
The polytope of degree partitions.
The Polytope of m-Subspaces of a Finite Affine Space
The m-subspace polytope is defined as the convex hull of the characteristic vectors of all m-dimensional subspaces of a finite affine space. The particular case of the hyperplane polytope has been investigated by Maurras (1993) and Anglada and Maurras (2003), who gave a complete characterization of the facets. The general m-subspace polytope that we consider shows a much more involved structure, notably as regards facets. Nevertheless, several families of facets are established here. Then the...
The predictive distribution in decision theory: A case study.
The Procedure to Determine Microstate Probabilities in a Trunk Group Serving Overflow Traffic
The queue-length in GI/G/ queues.
The random linear bottleneck assignment problem
The recurrent event process of a success preceded by a failure and its application.