找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 7829|回复: 47
发表于 2025-3-21 19:47:23 | 显示全部楼层 |阅读模式
书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II
编辑Richard W. Cottle
视频video
丛书名称Mathematical Programming Studies
图书封面Titlebook: Mathematiacl Programming Essays in Honor of George B. Dantzig Part II;  Richard W. Cottle Book 1985Latest edition Springer-Verlag Berlin He
出版日期Book 1985Latest edition
关键词algorithms; linear optimization; nonlinear optimization; optimization; polynomial; programming; sets
版次1
doihttps://doi.org/10.1007/BFb0121070
isbn_ebook978-3-642-00921-1Series ISSN 0303-3929 Series E-ISSN 2364-8201
issn_series 0303-3929
copyrightSpringer-Verlag Berlin Heidelberg 1985
The information of publication is updating

书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影响因子(影响力)




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II影响因子(影响力)学科排名




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II网络公开度




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II网络公开度学科排名




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引频次




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II被引频次学科排名




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




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II年度引用学科排名




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II读者反馈




书目名称Mathematiacl Programming Essays in Honor of George B. Dantzig Part II读者反馈学科排名




单选投票, 共有 1 人参与投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:27:36 | 显示全部楼层
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
发表于 2025-3-22 01:10:48 | 显示全部楼层
发表于 2025-3-22 04:59:18 | 显示全部楼层
发表于 2025-3-22 09:52:41 | 显示全部楼层
发表于 2025-3-22 12:55:24 | 显示全部楼层
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
发表于 2025-3-22 19:14:08 | 显示全部楼层
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
发表于 2025-3-22 22:58:12 | 显示全部楼层
发表于 2025-3-23 02:33:57 | 显示全部楼层
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
发表于 2025-3-23 08:46:35 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-22 11:42
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表