Simplex Method
2016-08-23
1 0 0
no vote
Other
Earn points
Solves the Linear Programming Problem.
(LP) min cx s.t. ax<=and=b, x>=0
The file reg.m is called to do phase 1
and phase
Data input by user or calling routine:
a,b,c,m1,m2 where
a - m by n1 matrix containing inequality constraints in the
first m1 rows and
equality constraints in the next m2 rows.
b - m-column vector assumed >=0
c - n1-row vector
m1,m2 - 2 nonnegative integers with
the number of ineqality and equality
matlab
Related Source Codes
GMSK Linear Receiver
0
0
no vote
NSGA-II algorithm
0
0
no vote
NSGA-III multi-objective optimization algorithm
0
0
no vote
Compressed sensing example
0
0
no vote
CFAR detector example
0
0
no vote
No comment