MCPcopy Index your code
hub / github.com/andeya/algorithm / Lp

Function Lp

cvx/solvers.go:28–68  ·  view source on GitHub ↗

Solves a pair of primal and dual LPs minimize c'*x subject to G*x + s = h A*x = b s >= 0 maximize -h'*z - b'*y subject to G'*z + A'*y + c = 0 z >= 0.

(c, G, h, A, b *matrix.FloatMatrix, solopts *SolverOptions,
	primalstart, dualstart *sets.FloatMatrixSet)

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

solveFunction · 0.85

Calls 5

SetMethod · 0.95
ConeLpFunction · 0.85
RowsMethod · 0.65
ColsMethod · 0.65
SizeMatchMethod · 0.65

Tested by 1

solveFunction · 0.68