I have a Linear program (LP) that can solve problem X with two objective functions a and b, I use the weighted sum method. I use Gurobi solver when I optimize the objective alone, the problem takes a lot of time (high complexity) and when I optimize only objective b the problem is solved in a few seconds.
I have implemented metaheuristic PSO using weighted sum and compared it with several metaheuristics. The problem is that the PSO find always the best solution for objective a and finds the worst value in terms of objective b.
So, I try to solve objective a using PSO, then solve objective b using Gurobi(solve my LP while making the first objective as a constraint)
With such a method, can I find the Pareto front? This method can be called hybrid PSO-LP? Have you other suggestions to solve my problem?