ON CHARACTERIZING THE SOLUTION SETS OF PSEUDOLINEAR PROGRAMS

Citation
V. Jeyakumar et Xq. Yang, ON CHARACTERIZING THE SOLUTION SETS OF PSEUDOLINEAR PROGRAMS, Journal of optimization theory and applications, 87(3), 1995, pp. 747-755
Citations number
11
Categorie Soggetti
Operatione Research & Management Science",Mathematics,"Operatione Research & Management Science
ISSN journal
00223239
Volume
87
Issue
3
Year of publication
1995
Pages
747 - 755
Database
ISI
SICI code
0022-3239(1995)87:3<747:OCTSSO>2.0.ZU;2-D
Abstract
This paper provides several new and simple characterizations of the so lution sets of pseudolinear programs. By means of the basic properties of pseudolinearity, the solution set of a pseudolinear program is cha racterized, for instance, by the equality that del f(x)(T)(<(x)over ba r-x> x)=0, for each feasible point x, where (x) over bar is in the sol ution set. As a consequence, we give characterizations of both the sol ution set and the boundedness of the solution set of a linear fraction al program.