Pareto reducibility of vector variational inequalities
A multicriteria optimization problem is called Pareto reducible if its weakly efficient solutions are Pareto solutions of the problem itself or a subproblem obtained from it by selecting certain criteria. The aim of this paper is to introduce a similar concept of Pareto reducibility for a class of vector variational inequalities. Key words: Vector variational inequality, Pareto reducibility. 2000 Mathematics Subject Classification: 49J40, 90C29.
|Date of creation:||Jan 2010|
|Contact details of provider:|| Postal: Via Ravasi 2-21100 Varese|
Web page: http://www.uninsubria.it/uninsubria/facolta/econo.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lowe, T.J. & Thisse, J.-F. & Ward, J.E. & Wendell, R.E., "undated".
"On efficient solutions to multiple objective mathematical programs,"
CORE Discussion Papers RP
600, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- T. J. Lowe & J.-F. Thisse & J. E. Ward & R. E. Wendell, 1984. "On Efficient Solutions to Multiple Objective Mathematical Programs," Management Science, INFORMS, vol. 30(11), pages 1346-1349, November.
When requesting a correction, please mention this item's handle: RePEc:ins:quaeco:qf1004. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Segreteria Dipartimento)
If references are entirely missing, you can add them using this form.