Multiobjective optimization with polygon boundary

I have a fixed designed space. I have the k values of conhull. How do I implement this boundary for the multiobjective optimization problem?

Answer 1

[Matt J]

Use vert2lcon to find the inequalities for the constrained region,

https://www.mathworks.com/matlabcentral/fileexchange/30892-analyze-n-dimensional-convex-polyhedra

Answer 2

[Walter Roberson]

convex hulls can always be represented as a series of linear inequalities, so you would use the "A" and "b" matrices

A = [....]
b = [...]
sol = gamultiobj(FUNCTION, num_parameters, A, b)

[neil vaz]

I have the hull points in three dimensions. So, should I be adding the x and y axis in A = [..] and z in b = [...] ?

[Walter Roberson]

The contribution mentioned by @Matt J looks very useful for constructing the appropriate matrices.

(I notice that Matt J wrote the contribution!)