0000000000505738
AUTHOR
T. Leon
An optimality test for semi-infinite linear programming
In this paper we present a test to characterize the optimal solutions for the continuous semi-infinite linear programming problem. This optimality characterization is a condition of Kuhn–Tucker type. The resolution of a linear program permits to check the optimality of a feasible point,to detect the unboundedness of the problem and to find descent directions. We give some illustrative examples. We show that the local Mangasarian–Fromovitz constraint qualification is almost equivalent to Slater qualification for this problem. Furthermore, it follows from our study that this optimality condition is always necessary for a wide class of semi-infinite linear programming problems
A functional approach to monitor and recognize patterns of daily traffic profiles
Functional Data Analysis (FDA) is a collection of statistical techniques for the analysis of information on curves or functions. This paper presents a new methodology for analyzing the daily traffic flow profiles based on the employment of FDA. A daily traffic profile corresponds to a single datum rather than a large set of traffic counts. This insight provides ideal information for strategic decision-making regarding road expansion, control, and other long-term decisions. Using Functional Principal Component Analysis the data are projected into a low dimensional space: the space of the first functional principal components. Each curve is represented by their vector of scores on this basis.…