版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:UNIV S FLORIDADEPT ELECT ENGNTAMPAFL 33620 UNIV S FLORIDADEPT PHYSTAMPAFL 33620
出 版 物:《APPLIED NUMERICAL MATHEMATICS》 (应用数值数学)
年 卷 期:1986年第2卷第1期
页 面:21-27页
核心收录:
学科分类:07[理学] 070104[理学-应用数学] 0701[理学-数学]
主 题:Complexity of algorithms feasible directions nonlinear optimization Lagrangian methods duality
摘 要:A certain nonlinear cost functional form which arises in optimal maintenance facility design is shown to take its minimum on the edges of corners of a hypercube. This results in a search procedure of complexity o (N 2 2 N ) . A novel algorithm is described which reduces the complexity to o (N 1n N) , by employing a judicious presort and a binary search.