首页 | 本学科首页   官方微博 | 高级检索  
     


Maximizing pseudoconvex transportation problem: a special type
Authors:Anju Gupta  M C Puri
Affiliation:(1) Department of Mathematics, Indian Institute of Technology, 110016 Hauz Khas, New Delhi, India
Abstract:The paper discusses a non-concave fractional programming problem aiming at maximization of a pseudoconvex function under standard transportation conditions. The pseudoconvex function considered here is the product of two linear functions contrasted with a positive valued linear function. It has been established that optimal solution of the problem is attainable at an extreme point of the convex feasible region. The problem is shown to be related to lsquoindefinitersquo quadratic programming which deals with maximization of a convex function over the given feasible region. It has been further established that the local maximum point of this quadratic programming problem is the global maximum point under certain conditions, and its optimal solution provides an upper bound on the optimal value of the main problem. The extreme point solutions of the lsquoindefinitersquo quadratic program are ranked to tighten the bounds on the optimal value of the main problem and a convergent algorithm is developed to obtain the optimal solution.
Keywords:Non-concave fractional programming  transportation problem  ranking in lsquoindefinitegif" alt="lsquo" align="BASELINE" BORDER="0">indefinitersquo quadratic programming" target="_blank">gif" alt="rsquo" align="BASELINE" BORDER="0"> quadratic programming
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号