Characterization of facets for multiple right-hand choice linear programs

Author(s):  
Ellis L. Johnson
Keyword(s):  
2019 ◽  
Vol 62 (1) ◽  
pp. 60-78
Author(s):  
Joshua W. Jipp

AbstractThe question of the relationship between “Judaism” and “Christianity” in the Acts of the Apostles has been marked by two contradictory interpretive traditions. One tradition emphasizes conflict and rupture, whereas the other sees continuity and a positive treatment of Judaism. These interpretive traditions both find significant textual support from Acts. There is an internal tension within Luke’s characterization of Paul that does not fit neatly into easy dichotomies and is representative of Luke’s broader two-volume work. The present author argues that the significance of God’s history within Israel centers upon Paul’s central conviction that Israel’s Davidic Messiah, resurrected and enthroned at God’s right hand, is the singular dispenser of salvation for Israel and the pagan nations. This messianic conviction results in a re-evaluation (not rejection) of Israel’s primary identity markers that will only be embraced if one grants Paul’s claim that the hope of Israel is identified with Jesus the resurrected Messiah.


Author(s):  
Sławomir Kołodziej ◽  
Ngoc Cuong Nguyen

AbstractWe prove the existence of a continuous quasi-plurisubharmonic solution to the Monge–Ampère equation on a compact Hermitian manifold for a very general measure on the right hand side. We admit measures dominated by capacity in a certain manner, in particular, moderate measures studied by Dinh–Nguyen–Sibony. As a consequence, we give a characterization of measures admitting Hölder continuous quasi-plurisubharmonic potential, inspired by the work of Dinh–Nguyen.


2021 ◽  
Vol 2021 ◽  
pp. 1-4
Author(s):  
Chengxue Zhang ◽  
Debin Kong ◽  
Peng Pan ◽  
Mingyuan Zhou

In a linear programming for horizontally partitioned data, the equality constraint matrix is divided into groups of rows. Each group of the matrix rows and the corresponding right-hand side vector are owned by different entities, and these entities are reluctant to disclose their own groups of rows or right-hand side vectors. To calculate the optimal solution for the linear programming in this case, Mangasarian used a random matrix of full rank with probability 1, but an event with probability 1 is not a certain event, so a random matrix of full rank with probability 1 does not certainly happen. In this way, the solution of the original linear programming is not equal to the solution of the secure linear programming. We used an invertible random matrix for this shortcoming. The invertible random matrix converted the original linear programming problem to a secure linear program problem. This secure linear programming will not reveal any of the privately held data.


1984 ◽  
Vol 17 (5) ◽  
pp. 362-362
Author(s):  
J. Kervarec ◽  
M. Baudet ◽  
J. Caulet ◽  
P. Auvrey ◽  
J. Y. Emery ◽  
...  

In the paper by Kervarec, Baudet, Caulet, Auvrey, Emery & Regreny [J. Appl. Cryst. (1984). 17, 196–205], an error has been introduced. On page 202, right-hand column, the second paragraph should read: The uneven surfaces of the interfaces can be taken into account by assuming that the SL is made of a juxtaposition of perfect crystallites of the same composition x whose period varies between the extreme values of 2n 1 d 1 + 2n 2 d 2. In this hypothesis, the experimental diagram is the sum of the X-ray diagrams given by each crystallite; the value of n 1 + n 2 deduced from such a diagram is an average value in the sample zone analyzed, therefore most of the time not integer.


2013 ◽  
Vol 15 (04) ◽  
pp. 1340033
Author(s):  
I. JEYARAMAN ◽  
K. C. SIVAKUMAR ◽  
V. VETRIVEL

In this paper, using Moore–Penrose inverse, we characterize the feasibility of primal and dual Stein linear programs over symmetric cones in a Euclidean Jordan algebra V. We give sufficient conditions for the solvability of the Stein linear programming problem. Further, we give a characterization of the globally uniquely solvable property for the Stein transformation in terms of a least element of a set in V in the context of the linear complementarity problem.


Author(s):  
Mihály Bessenyei ◽  
Zsolt Páles

The Hermite-Hadamard inequality not only is a consequence of convexity but also characterizes it: if a continuous function satisfies either its left-hand side or its right-hand side on each compact subinterval of the domain, then it is necessarily convex. The aim of this paper is to prove analogous statements for the higher-order extensions of the Hermite-Hadamard inequality. The main tools of the proofs are smoothing by convolution and the support properties of higher-order monotone functions.


Sign in / Sign up

Export Citation Format

Share Document