作者
D Bhatia, A Mehra, P Kumar
发表日期
2002/5/1
期刊
Recent Developments in Operational Research
页码范围
51
出版商
CRC PressI Llc
简介
A dual is proposed for the fractional'minmax programming problem with satisfaction conditions. Weak and strong duality theorems are proved under generalized convexity assumptions on the functions involved. The problem studied here require a solution at which the worst objective value attains its minimum over a set of solutions fulfilling satisfaction conditions.
学术搜索中的文章
D Bhatia, A Mehra, P Kumar - Recent Developments in Operational Research, 2002