How to find the feasible solution space of a nonlinear constraint optimization problem?
14 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
I want to find the feasible objective space of a Multi objective nonlinear constraint optimisation problem. The problem is in the following form.
min [F1(X),F2(X)]
hk(X)=0 k=1,...,ne % equality constraints
gi(X)≤0 i=1,...,n % Inequality constraints.
Ul<X<UB % UB and UL are upper and lower bounds of X
where X=[x1,x2,...,xj]
It should be noted that, some optimisation variables, (`some x`) are not bounded at the Ul<X<UB . But they will be restricted through the equality and inequality constraints.
SO basically as a possible solution I think that I should generate some random numbers for X=[x1,...,xn] first and then check the constraints. if generated point satisfies the constraint, so it is a feasible point in the solution space. Thus, I can pass it to the objective function to get its value [F1(X),F2(X)] in order for obtaining the feasible objective space. But I don't know how to check the constraint. Any idea?
Thanks for your help.
0 commentaires
Réponse acceptée
Matt J
le 14 Juin 2015
Modifié(e) : Matt J
le 14 Juin 2015
Assuming for the moment that you have no equality constraints, you would have to use NDGRID to generate a grid of samples in your N-dimensional space covering your bounded region Ul<X<UB. Then you would loop through the lattice of points, check which points satisfy the other inequality constraints, and then compute [f1,f2] for those points. Depending on the form of your constraints and objectives, there may also be vectorized ways of doing this, instead of looping.
When you do have equality constraints, then you would have to eliminate them by reparametrization. For example, linear equality constraints Aeq*x=0 define a linear space with basis vectors B1,B2,B3,... You can eliminate those constraints by reparametrizing X in terms of basis coefficients c1,c2,c3...
X=c1*B1+c2*B2+...
In other words, your vector of unknowns is now the vector c=[c1,c2,c3,...]. Rewriting your problem in terms of c eliminates the equality constraints. With non-linear equalities, this is harder to do, but I don't think you have much choice.
Finally, doing what you are attempting is only going to be possible if the dimension of the problem after eliminating equality constraints is reasonably low. Obviously, though, brute force numerical sampling is only something that was ever going to work in low dimensions. Random sampling won't work in large dimensions either. The volume of the feasible region can get very small as a fraction of an N-dimensional box as N gets large.
2 commentaires
Matt J
le 14 Juin 2015
I never said there was no way. I just said the reparametrization would be harder.
Plus de réponses (1)
Alan Weiss
le 5 Juin 2015
I am not sure what you are asking. It seems to me that you check the constraints by evaluating hk(X) and gi(X).
But you are unlikely to satisfy your equality constraints with a random point. I suggest that, if this is really the way you want to proceed, you first solve a feasibility problem. Set your objective function to @(x)0, and give only your nonlinear equality constraint to fmincon. Then for every initial guess you enter, you will get a "solution" that satisfies the nonlinear equality constraints. From there you can proceed as you outlined.
But I would not do this at all. I would use fgoalattain to try to find a tradeoff curve between my two objective functions, along the lines of this example.
Good luck,
Alan Weiss
MATLAB mathematical toolbox documentation
5 commentaires
Alan Weiss
le 8 Juin 2015
Again, I have a great deal of trouble understanding what you mean when you say "Unfortunately, the constraints are so tight, so a generated random guess doesn't exceed to a solution. However, with a proper initial guess, it converge to a solution."
Let me reiterate my suggestion.
- Construct a large number of initial points x0 in your solution space.
- For each initial point, use fmincon to solve the auxiliary nonlinear problem of minimizing the function @(x)0 subject to all of your constraints.
- Take all the resulting feasible points and plot them in your 2-D objective space. This will give you a series of dots that might cover a fair portion of your feasible objective space.
- If you have the Pareto front, you can plot that, too, and see whether the resulting feasible points trace out something close to the front.
Good luck,
Alan Weiss
MATLAB mathematical toolbox documentation
Voir également
Catégories
En savoir plus sur Multiobjective Optimization dans Help Center et File Exchange
Produits
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!