introduction: inequalities in urban environment are a significant concern. socioeconomic level plays an important role in these inequalities. inequality in environmental hazards is recognized as potential determinants of health disparities. materials & methods: in this study, we used individual and cumulative environmental hazard inequality indices to compare the inequality among 379 neighborho...

Tools for proving the absence of run-time errors often deploy a numeric domain that approximates the possible values of a variable using linear inequalities. These abstractions are adequate since the correct program state is often convex. For instance, if the upper and lower bound of an index lie within the bounds of an array, then so do all the indices inbetween. In certain cases, for example ...

The distance dG(u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length dG(u, v) is called uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for every two vertices a, b ∈ X. The convex domination number γcon(G) of a graph G equals the minimum cardinality of a convex dominating set. There are a larg...

We introduce a new way of generating cutting planes of a mixed integer programme by way of taking binary variables. Four binary variables are introduced to form quartic inequalities, which results in a reduced first-level mixed integer programme. A new way of weakening the inequalities is presented. An algorithm to carryout the separation of the inequalities, which are exponential in number, is...

Some new inequalities related to Jensen and Ostrowski inequalities for general Lebesgue integral are obtained. Applications for $f$-divergence measure are provided as well.

A set of vertices W resolves a graph G if every vertex of G is uniquely determined by its vector of distances to the vertices in W . The metric dimension for G, denoted by dim(G), is the minimum cardinality of a resolving set of G. In order to study the metric dimension for the hierarchical product G2 2 uG1 1 of two rooted graphs G2 2 and G u1 1 , we first introduce a new parameter, the rooted ...

Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths. We explicitly consider the unique path constraint associated with the a priori path in a time-dependent and stochastic network, and propose a number of reformulations to establish linear ineq...

Given an infeasible system of linear inequalities, Ax ≤ b, we address the problem of correcting both the matrix of coefficients A by A + H and vector b by b + p to minimize the Frobenius norm of [H, p]. For a system of linear equations this problem can be solved by an algebraic and well-studied method known as the Total Least Squares. For inequalities, Vatolin [?] was the first to approach this...

‎in this paper‎, ‎we introduce and study a class of generalized vector quasi-equilibrium problem‎, ‎which includes many vector equilibrium problems‎, ‎equilibrium problems‎, ‎vector variational inequalities and variational inequalities as special cases‎. ‎using one person game theorems‎, ‎the concept of escaping sequences and without convexity assumptions‎, ‎we prove some existence results for ...

we establish a relationship between general constrained pseudoconvex optimization problems and globally projected dynamical systems. a corresponding novel neural network model, which is globally convergent and stable in the sense of lyapunov, is proposed. both theoretical and numerical approaches are considered. numerical simulations for three constrained nonlinear optimization problems are giv...