Titlebook: Mathematiacl Programming Essays in Honor of George B. Dantzig Part II; Richard W. Cottle Book 1985Latest edition Springer-Verlag Berlin He

Flexibility

書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影響因子(影響力)




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影響因子(影響力)學(xué)科排名




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II網(wǎng)絡(luò)公開度




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引頻次




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引頻次學(xué)科排名




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II年度引用




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II年度引用學(xué)科排名




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II讀者反饋




書目名稱Mathematiacl Programming Essays in Honor of George B. Dantzig Part II讀者反饋學(xué)科排名

容易懂得

Linear complementarity problems solvable by a polynomially bounded pivoting algorithm,roblem defined by an . by .-matrix in no more than . pivots. The condition is then shown to be satisfied by a .-matrix which has a hidden . transpose and thus in particular, by an .-matrix with positive diagonals as well as by a strictly diagonally dominant matrix. The same condition is also shown t

antipsychotic

Metamorphosis

簡略

Feedback

Minimizing a unimodal function of two integer variables, its value (not its gradient), and that only at integer-valued points in its domain. Its minimum over the integers is required. We present an algorithm, which seems reasonably efficient, for solving this problem in the case of two variables. The algorithm can be extended to handle a quadratic functi

UNT

Existence and characterization of minima of concave functions on unbounded convex sets,t if the closure of the collection of extreme points is bounded and the function is lower semicontinuous thereon, the function attains its minimum on the set at an extreme point if and only if the function is bounded below on each half-line in the set. It is shown in this paper that this is so if an

DUCE

閑蕩

On the principle of monotone likelihood and log-linear models,ints and if certain functions of the sample-points take identical values. The Principle of Monotone Likelihood is satisfied for activity-equivalent samples if the sample with lower values of certain cost functions has greater likelihood than the sample with higher values of the cost functions. It is

Chronic