Results 241 to 250 of about 798,458 (265)
Some of the next articles are maybe not open access.
2013
Linear inequalities were studied with some degree of generality at least as early as the time of Fourier (1824). However the first significant contribution to their theory was made by Minkowski in his Geometrie der Zalzlen in 1896. Since that time many papers have appeared in Europe, America, and Japan which have to do more or less directly with the ...
Lloyd L. Dines, N. H. McCoy
openaire +3 more sources
Linear inequalities were studied with some degree of generality at least as early as the time of Fourier (1824). However the first significant contribution to their theory was made by Minkowski in his Geometrie der Zalzlen in 1896. Since that time many papers have appeared in Europe, America, and Japan which have to do more or less directly with the ...
Lloyd L. Dines, N. H. McCoy
openaire +3 more sources
Solution of Linear Inequalities
IEEE Transactions on Computers, 1970A method for solving systems of linear inequalities, consistent and inconsistent, corresponding to the separable and nonseparable cases in pattern recognition is presented. Attempts are made to evaluate the speed and efficiency of the algorithm.
openaire +3 more sources
Linear Differential Inequalities
SIAM Journal on Mathematical Analysis, 1978A notion of generalized zero with respect to a linear differential operator $L_n $ for a function f at a singular point of the operator was introduced by Levin and further considered by Willett. This involved a comparison of f with certain solutions of $L_n y = 0$ near the singular point. It is shown that the role of these solutions may be fulfilled by
openaire +3 more sources
The Relaxation Method for Linear Inequalities
Canadian Journal of Mathematics, 1954Let A be a closed set of points in the n-dimensional euclidean space En. If p and p1 are points of En such that1.1then p1 is said to be point-wise closer than p to the set A. If p is such that there is no point p1 which is point-wise closer than p to A, then p is called a closest point to the set A.
I. J. Schoenberg, T. S. Motzkin
openaire +3 more sources
On stochastic linear inequalities
Trabajos de Estadistica, 1959The author, in this unorthodox paper, discusses come actual problems of theory and methods of linear programming. He defines a compound matrix as a common property to all cases ofmatrix games: games theory. input-output analysis, theory of statistical decision and others; namely, mathematical programming.
openaire +3 more sources
Linear Equations and Linear Inequalities
2002While Chapter 1 reviews general structural aspects of real vector spaces, we now discuss fundamental computational techniques for linear systems in this chapter. For convenience of the discussion, we generally assume that the coefficients of the linear systems are real numbers.
Walter Kern, Ulrich Faigle, Georg Still
openaire +2 more sources
IEE Proceedings - Control Theory and Applications, 2003
Linear matrix inequalities (LMIs) have emerged as a powerful tool for numerically solving control problems that are difficult or impossible to solve analytically. The idea is to express a given problem as an optimisation problem with linear objective and semidefinite constraints, where the constraints involve symmetric matrices that are affine in the ...
openaire +2 more sources
Linear matrix inequalities (LMIs) have emerged as a powerful tool for numerically solving control problems that are difficult or impossible to solve analytically. The idea is to express a given problem as an optimisation problem with linear objective and semidefinite constraints, where the constraints involve symmetric matrices that are affine in the ...
openaire +2 more sources
Linear Inequalities and Polyhedra
2014The focus of this chapter is on the study of systems of linear inequalities Ax ≤ b. We look at this subject from two different angles. The first, more algebraic, addresses the issue of solvability of Ax ≤ b.
Michele Conforti +2 more
openaire +2 more sources
LINEAR EQUATIONS AND INEQUALITIES
2017As we have observed, the constraints of a meaningful linear program must include at least one linear inequality, but otherwise they may be composed of linear equations, linear inequalities, or some of each.
Richard W. Cottle, Mukund N. Thapa
openaire +2 more sources
Surrogate methods for linear inequalities
Journal of Optimization Theory and Applications, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

