Solving linear optimization problem
Show older comments
a(i),b(i) ∈ N, C are given. y(j) – integer variables vector. x(i,j) – binary variables matrix.
What’s the class of this task? MINLP?
As I understand, this function is multi-objective and non-convex so there are no ways to solve it with polynomial time algorithm. Possible variants are only exhaustive search (with some branch and bound optimization) or heuristic methods like genetic algorithm, etc.
Is it possible to solve it using MATLAB or some toolbox?
2 Comments
Matt J
on 13 Apr 2013
Your link didn't work (for me).
SAUMYA CHATURVEDI
on 18 Dec 2021
Hi gratix,
Can you please tell me how to solve the convex optimization problem using polynomial time algorithm in matlab?
Answers (1)
Matt J
on 13 Apr 2013
0 votes
The GA command has mixed integer programming options.
Categories
Find more on Solver Outputs and Iterative Display in Help Center and File Exchange
on 18 Dec 2021
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
