How to solve multiobjective optimization problem?

1 回表示 (過去 30 日間)
Rajkumar Verma
Rajkumar Verma 2020 年 6 月 21 日
コメント済み: Walter Roberson 2020 年 6 月 22 日
Dear all,
How can I solve the attched multiobjective optimization problem?
  2 件のコメント
Walter Roberson
Walter Roberson 2020 年 6 月 21 日
possibly a change of variables so that the logs on the right hand side of the st equations became linear variables (might require introducing a new variable to link 1-v1 and v1 in linear ways)? If that can be done then all those log(constant) in the st equations become just numeric constants in an A*x<=b linear inequality setup and it could be handled as a single objective system.
You cannot use fmincon for this because min() is not differentiateable as required by most of the minimizers. ga() or patternsearch()
Rajkumar Verma
Rajkumar Verma 2020 年 6 月 21 日
But, I want to solve this problem without making linear combination of log(1-v1) and log(v2). Because I need the values of v1 and v2 separately. Is there any way to solve without making linear combination?

サインインしてコメントする。

採用された回答

Alan Weiss
Alan Weiss 2020 年 6 月 21 日
If you have Global Optimization Toolbox you can use paretosearch or gamultiobj to find a Pareto set for your problem. See Multiobjective Optimization. If you need help after reading the examples in that section, ask again.
Alan Weiss
MATLAB mathematical toolbox documentation
  5 件のコメント
Walter Roberson
Walter Roberson 2020 年 6 月 22 日
yes, exact 0 or 1 are causing the non-real problem
Walter Roberson
Walter Roberson 2020 年 6 月 22 日
using gamultiobj is not appropriate for this problem. The task is not to find the Pareto front for the two logs. Your objective is a scalar, the min() of the two logs.

サインインしてコメントする。

その他の回答 (1 件)

Walter Roberson
Walter Roberson 2020 年 6 月 21 日
Is there any way to solve without making linear combination?
You could use ga with nonlinear inequalities.
There is another approach. You can do two seaches, one with the objective log(1-v1), and the other with objective log(v2). For each of those searches, the objective is continuous, so you can use fmincon() for each of them. Then take results that correspond to the search with the lower objective.
If you do this then you could use fmincon() with nonlinear constraints.
I have a suspicion that either the st on log(1-v1) or the st on log(v2) turn out to be equalities rather than inequalities, but I have not tested for that.
  1 件のコメント
Walter Roberson
Walter Roberson 2020 年 6 月 22 日
Separate fmincon works quite well, by the way. I did extensive search on the entire solution space and verified that the results from fmincon are within tolerance of the minimum possible.

サインインしてコメントする。

カテゴリ

Help Center および File ExchangeSolver Outputs and Iterative Display についてさらに検索

製品


リリース

R2020a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by