Duality theorems for a class of nonconvex programming problems |
| |
Authors: | O. Rani R. N. Kaul |
| |
Affiliation: | (1) Faculty of Mathematics, University of Delhi, Delhi-7, India |
| |
Abstract: | The object of this paper is to prove duality theorems for quasiconvex programming problems. The principal tool used is the transformation introduced by Manas for reducing a nonconvex programming problem to a convex programming problem. Duality in the case of linear, quadratic, and linear-fractional programming is a particular case of this general case.The authors are grateful to the referees for their kind suggestions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|