QQ客服 官方微博 反馈留言

	Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
	Zhang, Hao ; Wang, Shuning
	2010-05-06 ; 2010-05-06
关键词	separable objective function nonlinear programming piecewise-linear approximation global optimization Mathematics, Applied
中文摘要	The problem of minimizing a separable nonlinear objective function under linear constraints is considered in this paper. A systematic approach is proposed to obtain an approximately globally optimal solution via piecewise-linear approximation. By means of the new approach a minimum point of the original problem confined in a region where more than one linear piece is needed for satisfactory approximation can be found by solving only one linear programming problem. Hence, the number of linear programming problems to be solved for finding the approximately globally optimal solution may be much less than that of the regions partitioned. In addition, zero-one variables are not introduced in this approach. These features are desirable for efficient computation. The practicability of the approach is demonstrated by an example. (c) 2005 Elsevier B.V. All rights reserved.
语种	英语 ; 英语
出版者	ELSEVIER SCIENCE BV ; AMSTERDAM ; PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/9240]
专题	清华大学
推荐引用方式 GB/T 7714	Zhang, Hao,Wang, Shuning. Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation[J],2010, 2010.
APA	Zhang, Hao,&Wang, Shuning.(2010).Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation..
MLA	Zhang, Hao,et al."Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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