Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
General Math
Calculus
Differential Equations
Topology and Analysis
Linear and Abstract Algebra
Differential Geometry
Set Theory, Logic, Probability, Statistics
MATLAB, Maple, Mathematica, LaTeX
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Mathematics
General Math
How to write main and sub objective for optimisation
Reply to thread
Message
[QUOTE="Stephen Tashi, post: 5460146, member: 186655"] 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.) [/QUOTE]
Insert quotes…
Post reply
Forums
Mathematics
General Math
How to write main and sub objective for optimisation
Back
Top