Minimal cut-generating functions are nearly extreme

We study continuous (strongly) minimal cut generating functions for the model where all variables are integer. We consider both the original Gomory–Johnson setting as well as a recent extension by Y?ld?z and Cornuéjols (Math Oper Res 41:1381–1403, 2016). We show that for any continuous minimal or strongly minimal cut generating function, there exists an extreme cut generating function that approximates the (strongly) minimal function as closely as desired. In other words, the extreme functions are “dense” in the set of continuous (strongly) minimal functions.     

Sufficiency in multiobjective subset programming involving generalized type-I functions

In this paper, sufficient optimality conditions for a multiobjective subset programming problem are established under generalized -type-I functions.     

Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions

Recently, Hachimi and Aghezzaf defined generalized (F,α,ρ,d)-type I functions, a new class of functions that unifies several concepts of generalized type I functions. In this paper, the generalized (F,α,ρ,d)-type I functions are extended to nondifferentiable functions. By utilizing the new concepts, we obtain several sufficient optimality conditions and prove mixed type and Mond-Weir type duality results for the nondifferentiable multiobjective programming problem.     

Sufficiency and duality in differentiable multiobjective programming involving generalized type I functions

In this paper, new classes of generalized (F,α,ρ,d)-type I functions are introduced for differentiable multiobjective programming. Based upon these generalized functions, first, we obtain several sufficient optimality conditions for feasible solution to be an efficient or weak efficient solution. Second, we prove weak and strong duality theorems for mixed type duality.     

Sufficiency and invariance

Suppose that a statistical decision problem is invariant under a group of transformations g?G. T (X) is equivariant if there exists $\text{g}{}^1\text{? G}{}^1$ such that $\text{T(g(X)) = g}{}^1\text{(T((X))}$. We show that the minimal sufficient statistic is equivalent and that if T(X) is an equivariant sufficient statistics and d(X) is invariant under G, then $\text{d}{}^1\text{(T) = Ed(X)∥T}$ is invariant under $\text{G}{}^1$.     

Bi-Lipschitz Sufficiency of Jets

We give some theorems of bi-Lipschitz or C ¹ sufficiency of jets which are expressed by means of transversality with respect to some strata of a stratification satisfying the (L) condition of T. Mostowski. This enables us to prove that the number of metric types of intersection of smooth transversals to a stratum of an (a) regular stratification of a subanalytic set is finite.     

Equivariant Sufficiency and Stability

An equivariant version of Tougerone’s finite determinacy theorem along with a criterion for stability of an invariant germ are proved.     

Sufficiency theorems for optimal control

Two sufficiency theorems, related to those of Kalman, Athans and Falb, and Boltyanskii, are derived. The derivation is based on the invariance of a certain line integral along a solution curve reaching the terminal state set. The theorems are applied to some simple problems.This work was supported by the Office of Naval Research, Contract No. Nonr 3656 (31).     

Sufficiency theorems for target capture

A dynamical system is assumed to be governed by a set of ordinary differential equations subject to control. The set of points in state space from which there exist permissible controls that can transfer these points to a prescribed target set in a finite time interval is called a capture set. The task of determining the capture set is studied in two contexts. first, in the case of the system subject to a single control vector; and second, in the case of the system subject to two control vectors each operated independently. In the latter case, it is assumed that one controller's aim is to cause the system to attain the target, and the other's is to prevent that from occurring.Sufficient conditions are developed that, when satisfied everywhere on the interior of some subset of the state space, ensure that this subset is truly a capture set. A candidate capture set is assumed to have already been predetermined by independent methods. The sufficient conditions developed herein require the use of an auxiliary scalar function of the state, similar to a Lyapunov function.To ensure capture, five conditions must be satisfied. Four of these constrain the auxiliary state function. Basically, these four conditions require that the boundary of the controllable set be an envelope of the auxiliary state function and that that function be positive inside the capture set, approaching zero value as the target set is approached. The final condition tests the inner product of the gradient of the auxiliary state function with the system state velocity vector. If the sign of that inner product can be made negative everywhere within the test subset, then that subset is a capture set.Dedicated to Professor A. BusemannThe authors are indebted to Professors G. Leitmann and J. M. Skowronskii for their useful comments and discussion.     

Sufficiency and fuzziness in random experiments

In previous papers, the consequences of the “presence of fuzziness” in the experimental information on which statistical inferences are based were discussed. Thus, the intuitive assertion «fuzziness entails a loss of information» was formalized, by comparing the information in the “exact case” with that in the “fuzzy case”. This comparison was carried out through different criteria to compare experiments (in particular, that based on the “pattern” one, Blackwell's sufficiency criterion). Our purpose now is slightly different, in the sense that we try to compare two “fuzzy cases”. More precisely, the question we are interested in is the following: how will different “degrees of fuzziness” in the experimental information affect the sufficiency? In this paper, a study of this question is carried out by constructing an alternative criterion (equivalent to sufficiency under comparability conditions), but whose interpretation is more intuitive in the fuzzy case. The study is first developed for Bernoulli experiments, and the coherence with the axiomatic requirements for measures of fuzziness is also analyzed in such a situation. Then it is generalized to other random experiments and a simple example is examined.     

Sufficiency conditions with minimal regularity assumptions

The aim of this article is to provide second-order sufficiency criteria that extend known ones in [6] and [7] to the case where the control candidate and some of the data are merely essentially bounded, and/or the control setU is any convex subset of ^m . In the classical setting, where a restriction on the velocity is imposed , it is shown that whenU is compact the known strengthened Weierstrass condition is equivalent to the Weierstrass condition with strict inequality.The research was supported by an NSERC Grant and by GNAFA of CNR, which are gratefully acknowledged.     

非光滑多目标规划的二阶充分性

本文给出了古典方向导数的一、二阶定义，借助于平均值理论给出非光滑多目标规划的二阶充分性条件。     

Sufficiency and completeness in the linear model

This paper provides further contributions to the theory of linear sufficiency and linear completeness. The notion of linear sufficiency was introduced by [2], Ann. Statist. 9, 913–916) and Drygas (in press, Sankhya) with respect to the linear model Ey = Xβ, var y = V. In addition to correcting an inadequate proof of [8], the relationship to an earlier definition and to the theory of linear prediction is also demonstrated. Moreover, the notion is extended to the model Ey = Xβ, var y = δ²V. Its connection with sufficiency under normality is investigated. An example illustrates the results.     

Sufficiency for Optimal Control Problems Involving Parameters

The optimal control problem is extended to the case where the performance index, the differential constraints, and the prescribed final conditions contain parameters. The sufficient condition for a minimum is derived for nonsingular problems using the sweep method. As expected, it involves the finiteness of a matrix or the location of the conjugate point. The minimum-time navigation problem is solved as a fixed final time problem to illustrate the application of the theory.     

Sufficiency conditions for multiple integral control problems

The construction of multiple integrals which are independent, in the sense that they depend solely on the values of their integrands on the boundary of the domain of integration is described. These integrals are applied to the derivation of a sufficiency condition for multiple integral optimal control problems.This research was supported in part by NSF Grant No. GP-32830.     

套重复测量模型的充分性和估计

当每一个体有相同的子个体,并且每一子个体的处理水平是成对的时候,我们使用套重复测量模型.令Yi=(Yilll,…Yimrc)′是第i个个体的观测向量.假设Yi为相互独立的正态分布,均值为μi,协方差阵为∑＞0.假设可简化为所有测量值的方差为σ2;相同个体的不同子个体之间的成对测量值之间的关系如下(1)不同列不同行的观测值;(2)相同列不同行的测量值;(3)相同行不同列的测量值,它们的协方差分别为ρ2σ2,ρ3σ2,ρ4σ2.我们假设试验是给定的,用坐标自由(coordinate-free)的方法研究了套重复测量模型的完备充分统计量,最小方差无偏估计(MVUE)和极大似然估计(MLE).