On Linear Fractional Programming Problem and its Computation Using a Neural Network Model |
| |
Authors: | S K Neogy A K Das P Das |
| |
Institution: | (1) Indian Statistical Institute, New Delhi, 110 016, India;(2) Indian Statistical Institute, Kolkata, 700 108, India |
| |
Abstract: | In this paper we consider linear fractional programming problem and look at its linear complementarity formulation. In the
literature, uniqueness of solution of a linear fractional programming problem is characterized through strong quasiconvexity.
We present another characterization of uniqueness through complementarity approach and show that the solution set of a fractional
programming problem is convex. Finally we formulate the complementarity condition as a set of dynamical equations and prove
certain results involving the neural network model. A computational experience is also reported.
|
| |
Keywords: | KKT condition Complementarity condition Uniqueness of solutions Convex set Nonlinear dynamic system Linear projection equation |
本文献已被 SpringerLink 等数据库收录! |
|