Is common use Heuristics (Pareto Front) when you have NP-Hard problems. Likewise, when you have multi-objective problems people often use heuristics.
I have heard which if you want to model (linear programming or non-linear programming) a problem with two objectives you should establish an objective function as a restriction or should divide two functions to get a new function and then, working as a mono-objective problem.
When you have two objectives you will get non-dominated solutions the most cases (obviously with an algorithm, e.g. NSGA II). But what happens if you don't have heuristics and instead you have a mathematical model?. Is possible to get the best Pareto front using mathematical modeling?
Thank you M. Osman for your answer. The question is also if there is an generic example of this mathematical bi-objective problem.
- Badges
- Science topic
- Similar topics
- Computer Science
- Program