How to write main and sub objective for optimisation

  • Context: Undergrad 
  • Thread starter Thread starter Dominik Tugend
  • Start date Start date
  • Tags Tags
    Optimisation Programming
Click For Summary

Discussion Overview

The discussion centers on how to properly formulate main and sub-objectives in optimization problems, specifically when dealing with two objective functions: minimizing X and minimizing Y. Participants explore the challenges of expressing these objectives mathematically, particularly in the context of multi-criteria optimization.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • One participant describes a desire to establish a main objective (minimize X) and a sub-objective (minimize Y) and expresses uncertainty about how to write this down properly.
  • Another participant references a resource from Economics Stack Exchange, suggesting that it may not be possible to represent the desired preference relation with a utility function, indicating a potential limitation in formulating the problem.
  • A later reply proposes a mathematical approach to express the objectives, suggesting a two-pass algorithm and defining sets of feasible solutions based on minimizing X and Y.
  • There is mention of special situations where minimizing Y could be expressed as a constraint on minimizing X, but this is noted to depend on specific problem details.
  • Terminology such as "multi-criteria optimization" and "lexicographic multi-criteria optimization" is introduced as relevant for further exploration of the topic.

Areas of Agreement / Disagreement

Participants do not reach a consensus on how to formulate the objectives, and multiple competing views remain regarding the feasibility of expressing the problem mathematically.

Contextual Notes

Limitations include the potential inability to represent certain preference relations and the dependence on specific problem details for formulating the objectives.

Dominik Tugend
Messages
19
Reaction score
1
I have had this problem that I didn't know how to write it properly in this thread.

Let's say I have two objective functions:
  1. minimize X
  2. minimize Y
Let's say I want 1. as main objective and 2. a sub objective - by that I mean if there is a set of optimal solutions for 1., then final solution can only be from that set and in such a way that it's the best for 2 from all of that set for 1.

My problem is I don't know how to write this down properly.

The only idea I have had so far doesn't work in all cases:
If 0 \leq Y \leq C and C \in \mathbb{R}_{\geq 0}, then I could rewrite the objective as
minimize X*(C+1) +Y
 
Last edited:
Mathematics news on Phys.org
Last edited:
Dominik Tugend said:
I have had this problem that I didn't know how to write it properly in this thread.

Let's say I have two objective functions:
  1. minimize X
  2. minimize Y
Let's say I want 1. as main objective and 2. a sub objective - by that I mean if there is a set of optimal solutions for 1., then final solution can only be from that set and in such a way that it's the best for 2 from all of that set for 1.

My problem is I don't know how to write this down properly.

The only idea I have had so far doesn't work in all cases:
If 0 \leq Y \leq C and C \in \mathbb{R}_{\geq 0}, then I could rewrite the objective as
minimize X*(C+1) +Y

You made the correct conclusion from the link on stackexchange. (As to the details on stackexchange - those posters know more about the question that I do.) However, if your are dealing with a problem in physics, your "preference relation" might be much simpler than such a thing is in theoretical economics. The preference relations in economics try to express human whims. (e.g. "I'd rather have 2 houses, 6 cars, 1 dog and 1 cat rather than have 3 houses, 4 cars, no dogs, and 1 cat".)

The most general way of writing the objective is to write it in a way that would translate into a "two pass" algorithm. You did that in words. You could make your statement look fancier by using more mathematical notation.

Let ##F## be the set of feasible solutions for the problem. Let ##S_x## be the set of solutions that minimize ##X(s)##, i.e. Let ##m_X = min\{ X(s): s \in F\}## and ##S_X = \{s: X(s) = m\}##. Then let ##S## be the subset of ##S_x## that minimizes ##Y(s)##, i.e. Let ##m_Y = min\{Y(s):s \in S_X\}## and ##S = \{s:Y(s)=m_Y\}##.

In special situations, you can attain the goal "2. minimize ##Y(s)##" by expressing it (or some property related to it) as a constraint on the problem "1. minimize ##X(s)##".

The relevant terminology for doing an internet search on the general question is "multi-criteria optimization" and "lexicographic multi-criteria optimization".

Your specific goal seems to be to express the problem as a problem of minimizing a single function ##F(s)##. How to do that (and whether it is possible) depends on the specific details of problem.

(Looking on the bright side, most of mathematics consists of finding interesting situations where things that are not always possible in general become possible.)
 
  • Like
Likes   Reactions: Dominik Tugend
Thank you very much for your reply :-)
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K