User Star

7 votes

4 answers

5k views

LP feasibility checking

asked Jun 22, 2012 at 9:59

7 votes

1 answer

3k views

Biconvex optimization problems

asked Apr 19, 2013 at 13:10

4 votes

1 answer

107 views

Linear programming boundedness

asked Jul 16, 2012 at 8:17

3 votes

2 answers

756 views

NP-Completeness

asked Jul 9, 2013 at 11:29

3 votes

1 answer

234 views

polynomial time solvability

asked Feb 12, 2013 at 21:04

2 votes

1 answer

91 views

Nonlinear bad constraints

asked Feb 7, 2013 at 11:57

2 votes

1 answer

90 views

Rational LP to integer LP

asked Jul 25, 2012 at 17:06

2 votes

0 answers

688 views

Finding a permutation that makes a matrix lower triangular

asked Jun 22, 2012 at 12:20

2 votes

1 answer

159 views

k-splittable flow problem

asked Jul 25, 2013 at 13:43

2 votes

1 answer

567 views

Comparison of convex hulls [closed]

asked Aug 13, 2015 at 12:56

1 vote

2 answers

178 views

Sparse non-square system of linear equations in exact arithmetic [closed]

asked Jul 12, 2012 at 7:52

1 vote

0 answers

87 views

Proportional equality constraints

asked Jun 21, 2012 at 16:15

1 vote

1 answer

212 views

Why isn't every linear program combinatorial?

asked Jun 21, 2012 at 18:32

1 vote

1 answer

337 views

Fast Algorithms for solving sparse LP problems

asked Jul 25, 2012 at 17:42

1 vote

1 answer

701 views

Feasibility checking

asked Feb 14, 2013 at 10:51

1 vote

0 answers

21 views

Reduction for NP-hardness [duplicate]

asked Jul 18, 2013 at 9:28

1 vote

0 answers

250 views

Robust Counterpart of an uncertain LP

asked Mar 4, 2013 at 13:57

0 votes

1 answer

106 views

Unique Partition of a Graph

asked Apr 5, 2013 at 13:31

0 votes

1 answer

35 views

Polynomial solvability [duplicate]

asked Feb 15, 2013 at 17:21

0 votes

1 answer

230 views

Semidefinite programming

asked Feb 10, 2013 at 18:20

0 votes

0 answers

52 views

Lagrangian Duality [duplicate]

asked Oct 1, 2012 at 15:08

0 votes

1 answer

581 views

Min-cost flow problem

asked Jul 16, 2012 at 12:59

0 votes

1 answer

187 views

LP infeasibility

asked Feb 7, 2012 at 14:11

0 votes

2 answers

155 views

Nonconvex Optimization

asked Jan 27, 2014 at 18:07

0 votes

1 answer

89 views

difference of polytopes in $\mathbb{R}^n$

asked Jul 28, 2014 at 14:19

Stack Exchange Network

25 Questions

LP feasibility checking

Biconvex optimization problems

Linear programming boundedness

NP-Completeness

polynomial time solvability

Nonlinear bad constraints

Rational LP to integer LP

Finding a permutation that makes a matrix lower triangular

k-splittable flow problem

Comparison of convex hulls [closed]

Sparse non-square system of linear equations in exact arithmetic [closed]

Proportional equality constraints

Why isn't every linear program combinatorial?

Fast Algorithms for solving sparse LP problems

Feasibility checking

Reduction for NP-hardness [duplicate]

Robust Counterpart of an uncertain LP

Unique Partition of a Graph

Polynomial solvability [duplicate]

Semidefinite programming

Lagrangian Duality [duplicate]

Min-cost flow problem

LP infeasibility

Nonconvex Optimization

difference of polytopes in $\mathbb{R}^n$