Share Your Research, Maximize Your Social Impacts
Duality for Vector Optimization Problems with Cone Constraints Involving Support Functions
Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 6)Publication Date: 2014-06-15
Authors : Priyanka Yadav;
Page : 776-784
Keywords : "vector optimization; cones; Mond-Weir dual; invexity; quasi-(pseudo)invexity; higher order type I functions; higher order pseudoquasi-type I functions; higher order (F; ) type I functions; higher order (F; )-pseudoquasi-type I functions.";
Source : Download
Find it from : Google Scholar
- Finding Frequent Pattern by Reducing Transctions Scan
- Finding Frequent Pattern with Transaction and Occurrences based on Density Minimum Support Distribution
- Novel Approach for Frequent Pattern Algorithm for Maximizing Frequent Patterns in Effective Time
- A NOVEL STRATEGY FOR FINDING FREQUENT ITEMS IN DYNAMIC XML DISSEMINATION
- An Approach for Finding Frequent Item Set Done By Comparison Based Technique
Abstract
"In this work, first and higher order duality is discussed for vector optimization problems with cone constraint where every component of the objective function contains a term involving the support function of a compact convex set. It is an attempt to remove certain omissions and inconsistencies in the work of Kim and Lee (Nonlinear Anal. Theory Meth. Appl. 71 (2009),2474-2480)."
Other Latest Articles
- Knowledge Navigator for Intelligent Collaborative E-Tutoring: A Proposed Framework using Fuzzy Cognitive Agent
- Youssef Syndrome: A Case Report with Review of Literature
- An Optimum Method for Enhancing the Computational Complexity of K-Means Clustering Algorithm with Improved Initial Centers
- Critical Analysis of Fuel Pump Bleed Valve for Typical Jet Engine by Using FMEA Method
- Pattern discovery on the World Wide Web by Using Web Mining Methods: A Review
Last modified: 2014-06-24 18:06:18