Journal of Optimization Theory and Applications

, Volume 87, Issue 3, pp 747–755

On characterizing the solution sets of pseudolinear programs

Authors

  • V. Jeyakumar
    • Department of Applied MathematicsUniversity of New South Wales
  • X. Q. Yang
    • Department of MathematicsUniversity of Western Australia
Technical Note

DOI: 10.1007/BF02192142

Cite this article as:
Jeyakumar, V. & Yang, X.Q. J Optim Theory Appl (1995) 87: 747. doi:10.1007/BF02192142

Abstract

This paper provides several new and simple characterizations of the solution sets of pseudolinear programs. By means of the basic properties of pseudolinearity, the solution set of a pseudolinear program is characterized, for instance, by the equality that\(\nabla f(x)^T (\bar x - x) = 0\), for each feasible pointx, where\(\bar x\) is in the solution set. As a consequence, we give characterizations of both the solution set and the boundedness of the solution set of a linear fractional program.

Key Words

Solution setspseudolinear programslinear fractional programs
Download to read the full article text

Copyright information

© Plenum Publishing Corporation 1995