QQ客服 官方微博 反馈留言

	A new infeasible interior-point algorithm with full step for linear optimization based on a simple function
	Zhang, Lipu[1]; Xu, Yinghong[2]
刊名	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
	2011
卷号	88页码:3163-3185
关键词	linear optimization infeasible interior-point algorithm full step complexity analysis
ISSN号	0020-7160
URL标识	查看原文
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/2301031
专题	上海大学
作者单位	1.[1]Zhejiang A&F Univ, Dept Math, Hangzhou 311300, Zhejiang, Peoples R China.,Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China. 2.[2]Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China.
推荐引用方式 GB/T 7714	Zhang, Lipu[1],Xu, Yinghong[2]. A new infeasible interior-point algorithm with full step for linear optimization based on a simple function[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS,2011,88:3163-3185.
APA	Zhang, Lipu[1],&Xu, Yinghong[2].(2011).A new infeasible interior-point algorithm with full step for linear optimization based on a simple function.INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS,88,3163-3185.
MLA	Zhang, Lipu[1],et al."A new infeasible interior-point algorithm with full step for linear optimization based on a simple function".INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 88(2011):3163-3185.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。