Question

Minimize $\text{Cost}(j_1, ..., j_n)=\sum_{i=1}^{n-1}T_{j_i}\left( \sum_{k=i+1}^{n}L_{j_k} \right)$

score 36 · Answer 1 · 2026-03-25 12:28:14

36

Views

Minimize $\text{Cost}(j_1, ..., j_n)=\sum_{i=1}^{n-1}T_{j_i}\left( \sum_{k=i+1}^{n}L_{j_k} \right)$

Published on 25 Mar 2026 - 12:28

score 122 · Answer 2 · 2018-02-22 23:04:54

122

Views

Why does transforming a 2-D shape defined by a 2xn matrix using a Singular Transformation Matrix always result in a line?

Published on 22 Feb 2018 - 23:04

score 667 · Answer 3 · 2018-02-24 03:15:19

667

Views

Can someone explain how to do the change of variables in a linear programming problem?

Published on 24 Feb 2018 - 3:15

score 1.8k · Answer 4 · 2026-03-23 04:11:39

1.8k

Views

Stuck on two phase simplex where RHS $= 0$

Published on 23 Mar 2026 - 4:11

score 2.6k · Answer 5 · 2026-03-20 06:42:08

2.6k

Views

Formulating LPP from given optimal table in Simplex method

Published on 20 Mar 2026 - 6:42

score 199 · Answer 6 · 2026-03-23 01:41:32

199

Views

Two phase simplex when constraint is the same as minimize function

Published on 23 Mar 2026 - 1:41

score 365 · Answer 7 · 2026-03-22 12:59:49

365

Views

LP relaxation of the symmetric TSP problem integrality for n=5

Published on 22 Mar 2026 - 12:59

score 61 · Answer 8 · 2026-03-24 20:30:48

61

Views

A Network Flow Problem Involving Redefined Labeling

Published on 24 Mar 2026 - 20:30

score 117 · Answer 9 · 2026-03-25 09:29:10

117

Views

What are the objective values of min (min($x_1,x_2$)) such that $x_1,x_2 \geq 0$

Published on 25 Mar 2026 - 9:29

score 130 · Answer 10 · 2026-03-25 10:43:20

130

Views

projector on the boundary of a simplex. aka find basis for subspace $\sum_j x_j=0$.

Published on 25 Mar 2026 - 10:43

score 353 · Answer 11 · 2018-02-27 22:48:07

353

Views

Is there a quick way to determine if certain combinations of columns of a matrix are linearly independent? (finding basic feasible solutions)

Published on 27 Feb 2018 - 22:48

score 51 · Answer 12 · 2026-03-25 09:23:48

51

Views

Proving unequality for two-stage stochastic LP

Published on 25 Mar 2026 - 9:23

score 1.2k · Answer 13 · 2018-03-01 06:22:38

1.2k

Views

What is the use/significance of Farkas' lemma?

Published on 01 Mar 2018 - 6:22

score 38 · Answer 14 · 2018-03-01 12:34:47

38

Views

Is (12!)(9!)(16!) too many configurations for a brute force solution?

Published on 01 Mar 2018 - 12:34

score 94 · Answer 15 · 2018-03-01 21:04:51

94

Views

Question regarding duality in linear programming

Published on 01 Mar 2018 - 21:04

List Question

Minimize $\text{Cost}(j_1, ..., j_n)=\sum_{i=1}^{n-1}T_{j_i}\left( \sum_{k=i+1}^{n}L_{j_k} \right)$

Why does transforming a 2-D shape defined by a 2xn matrix using a Singular Transformation Matrix always result in a line?

Can someone explain how to do the change of variables in a linear programming problem?

Stuck on two phase simplex where RHS $= 0$

Formulating LPP from given optimal table in Simplex method

Two phase simplex when constraint is the same as minimize function

LP relaxation of the symmetric TSP problem integrality for n=5

A Network Flow Problem Involving Redefined Labeling

What are the objective values of min (min($x_1,x_2$)) such that $x_1,x_2 \geq 0$

projector on the boundary of a simplex. aka find basis for subspace $\sum_j x_j=0$.

Is there a quick way to determine if certain combinations of columns of a matrix are linearly independent? (finding basic feasible solutions)

Proving unequality for two-stage stochastic LP

What is the use/significance of Farkas' lemma?

Is (12!)(9!)(16!) too many configurations for a brute force solution?

Question regarding duality in linear programming

Trending Questions

Popular # Hahtags

Popular Questions