A (p, q)-graph G is called super edge-magic if there exists a bijective function f : V (G) ∪ E(G) → {1, 2, . . . , p + q} such that f(u)+f(v)+f(uv) is a constant for each uv ∈ E(G) and f(V (G)) = {1, 2, . . . , p}. In this paper, we introduce the concept of strong super edgemagic labeling as a particular class of super edge-magic labelings ∗Supported by Slovak VEGA Grant 1/4005/07. †Supported i...

Finite-dimensional linear programs satisfy strong duality (SD) and have the “dual 8 pricing” (DP) property. The (DP) property ensures that, given a sufficiently small perturbation of 9 the right-hand-side vector, there exists a dual solution that correctly “prices” the perturbation by 10 computing the exact change in the optimal objective function value. These properties may fail in 11 semi-inf...

The combination of proteins with acids has been studied by Loeb I and others largely by means of hydrogen electrode measurements. The present work constitutes an attempt to apply the method of conductivity titration to the determination of the combining capacity of a protein for acids. The first work which indicated that the measurement of electrical conductivity could be used in volumetric ana...

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality ...

Many combinatorial optimisation problems can be modelled as integer linear programs. We consider a class of generalised integer programs where the constraints are allowed to be taken from a broader set of relations (instead of just being linear inequalities). The set of allowed relations is defined using a many-valued logic and the resulting class of relations have provably strong modelling pro...

In 1951, Dantzig [3] showed the equivalence of linear programming and two-person zero-sum games. However, in the description of his reduction from linear programming to zero-sum games, he noted that there was one case in which his reduction does not work. This also led to incomplete proofs of the relationship between the Minmax Theorem of game theory and the Strong Duality Theorem of linear pro...

In a general discrete-time market model with proportional transaction costs, we derive new expectation representations of the range of arbitrage-free prices of an arbitrary American option. A surprising feature of the upper bound representation is that it necessarily involves a randomized exercise strategy, given by a mixture of ordinary stopping times. In particular the upper bound is the maxi...

In this study, we analyzed the conservation of a semi-liquid bio-preserver (SL778) developed with Lactobacillus plantarum CRL 778, a lactic acid bacterium (LAB) having antifungal activity. The characteristics of the SL778 starter remained stable during a 14-day storage at 4°C. At -20°C, cell viability and organic acid concentration showed a significant (p<0.05) decrease after 7 days. These diff...