Abstract
Abstract In the present paper a non-convex quadratic programming problem is studied in which the optimal feasible solution in addition to satisfying a general set of constraints is required to be an extreme point of a convex polytope. A linear programming problem is constructed whose basic feasible solutions are ranked in non-decreasing order of the value of its objective function and this inturn ranks the extreme points of the convex polytope in non-decreasing order of the value of the objective function of the aforementioned quadratic programming problem. The ranking of extreme points is carried out till an optimal feasible solution of the main problem is obtained.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
