Subject
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Wechat
  • Email
  • Sign Up
  • Forgot password?
    Sign Up
  • Confirm
    Agreement onAcademic agreement
    Sign In
Subject
  • Subject
  • Journal
  • Author
  • Organization
  • Keywords
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Wechat
  • Email
  • Sign Up
  • Forgot password?
    Sign Up
  • Confirm
    Agreement onAcademic agreement
    Sign In
Collection
For ￥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A relaxed projection method for solving multiobjective optimization problems

Author:
Brito, A. S.  Cruz Neto, J. X.  Santos, P. S. M.  Souza, S. S.  


Journal:
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH


Issue Date:
2017


Abstract(summary):

In this paper, we propose an algorithm for solving multiobjective minimization problems on nonempty closed convex subsets of the Euclidean space. The proposed method combines a reflection technique for obtaining a feasible point with a projected subgradient method. Under suitable assumptions, we show that the sequence generated using this method converges to a Pareto optimal point of the problem. We also present some numerical results. (C) 2016 Elsevier B.V. All rights reserved.


Page:
17---23


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

FAQscontactonacademic@126.com

©Wirey All Rights Reserved

Submit Feedback

This function is a member function, members do not limit the number of downloads