Linear programming, interested in only 1 variable
1 visualizzazione (ultimi 30 giorni)
Mostra commenti meno recenti
Richárd Tóth
il 16 Set 2019
Commentato: Richárd Tóth
il 16 Set 2019
Hello
It might be a stupid question, but I'm a bit confused. You have inequalities, want to find the smallest for example value.
So you need to solve s.t. . Calling a solver will give a result with
Is this the correct way to solve it? variable values are meaningless
0 Commenti
Risposta accettata
Bruno Luong
il 16 Set 2019
Modificato: Bruno Luong
il 16 Set 2019
If you want to minimize x1 under A*x <= b
f = zeros(size(x));
f(1) = 1;
x = linprog(f, A, b);
(x2,...,xn) is not meaningless, it's the associate components such that your constraint A*x <= b is satisfied.
Imagine you want to find most left corner of a 2D triangle.
It can be written as
A*x <= b
with x is 2 x 1, A is 3 x 2, b and 3 x 1.
the LINPROG returns you (x1,x2) coordinates of the left most corner (minimize x1) even if you ignore x2 it's still the ordinate of the corner.
Più risposte (0)
Vedere anche
Categorie
Scopri di più su Creating and Concatenating Matrices in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!