All Questions
1,545 questions
1
vote
1
answer
9k
views
what is the difference between the revised simplex method andthe full tableu?
No to sound naive but they look like they include the same steps to me, one's just the algorithmical representation of the other. Thanks in advance.
- 111
7
votes
2
answers
505
views
Isodiametric hull
Let A be a convex compact set in the plane (with a piecewise smooth boundary, say). We want to `inflate' it in such a way that the diameter does not increase.
More accurately, we are looking for ...
- 2,135
2
votes
0
answers
281
views
Recovering a piecewise affine function
Lets say I have an piecewise affine convex function $f(x_1,x_2)$, on which the following operations are possible:
Computing $f(x_1,x_2)$.
Computing a subgradient to $f$ at $(x_1,x_2)$
Computing all ...
- 567
2
votes
2
answers
640
views
Sorting a binary matrix diagonal in polynomial time while preserving rows
Is there a polynomial time solution to sort an arbitrary binary square matrix in polynomial time by rows so that the diagonal contains a 1 if any row contains a 1 in that column?
For example given ...
- 121
0
votes
1
answer
1k
views
For Ax = b, x and b unknown vectors, how do I solve the x that maximizes min(b_i)?
Given a matrix $A$, each element $A_{i,j} \geq 0$, find the vector $\vec x$ that maximizes the minimum element in $\vec b$ ($\vec b = A \vec x$). Note that this is not a linear equation system as I ...
- 135
3
votes
0
answers
142
views
Dimension of convex arrangements for hypergraphs
Suppose you have a hypergraph H on n vertices. Let d be the smallest integer such that we can find an arrangement A of convex subsets in Rd so that H represent the intersections of sets in A.
Has ...
- 4,586
33
votes
3
answers
2k
views
Polar body of a convex body that avoids a lattice
Let $K \subset {\bf R}^d$ be a symmetric convex body (an open bounded convex neighbourhood of the origin with $K = -K$) with the property that $K + {\bf Z}^d \neq {\bf R}^d$, i.e. the projection of $K$...
- 114k
5
votes
2
answers
3k
views
Continuous Linear Programming: Estimating a Solution
I have a "continuous" linear programming problem that involves maximizing a linear function over a curved convex space. In typical LP problems, the convex space is a polytope, but in this case the ...
- 373
5
votes
3
answers
7k
views
Estimate probability( 0 is in the convex hull of N random points ) ?
Can anyone estimate N such that Prob( 0 is in the convex hull of $N$ points ) >= .95
for points uniformly scatterered in $[-1,1]^d$, $d = 2, 3, 4, 10$ ?
The application is nearest-neghbour ...
- 265
4
votes
1
answer
275
views
Symmetry of the integer gap
Are there results that bound the asymmetry of the duality gap of an integer program? That is to say, if the difference between the LP solution and the IP (primal) solution is $a$, is there a function ...
- 183
5
votes
2
answers
1k
views
Applications of minmax theorem(s)
Intro We suppose $X$ and $Y$ are nonempty sets and f: $X\times Y \rightarrow \mathbb{R}$. A minimax theorem is a theorem that asserts that, under certain conditions,
$$ \inf_Y \sup_X f = \sup_X \...
1
vote
3
answers
2k
views
How to solve Linear Programming problem with tighter Integer Programming constraints
I want to learn a bit about Linear Programming.
After some research, I decided to solve the Cutting Stock problem as an example to learn. After doing some more research, I feel like I finally ...
9
votes
1
answer
6k
views
Proving that a binary matrix is totally unimodular
I'm working on a set of problems for which I can formulate binary integer programs. When I solve the linear relaxations of these problems, I always get integer solutions. I would like to prove that ...
- 213
2
votes
1
answer
1k
views
Condition number for Ellipsoid method matrix
Hello,
When using the ellipsoid method (for solving a linear program for example), the volume of the ellipsoid at each iteration is proven to decrease, and do so by at least a factor of $e^{1/2n}$.
...
- 88
10
votes
3
answers
6k
views
Solving a system of linear inequalities -- what is the dimension of the solution set?
It is well known how to solve a system of linear equations $A{\bf x} = {\bf b}$, but how do we solve a system of linear inequalities $A{\bf x} \leq {\bf b}$?
For the applications I have in mind the ...
- 7,857
6
votes
2
answers
8k
views
Existence/Uniqueness of Nonnegative Solutions of Linear Systems of Equations
Suppose we have an $m$x$n$ matrix $A$, with $m\lt n$, and an $m$x$1$ vector $b$. Are there existence and uniqueness conditions characterizing nonnegative solutions of the system of linear equations $...
16
votes
5
answers
1k
views
A characterization of convexity
While doing some research on polytopes I came to the following question. Maybe it's already somewhere but anyway I'll post it here.
Let $X\subset \mathbb{R}^3$ be such that, for every plane $P$, $P\...
- 1,001
4
votes
1
answer
866
views
When is a triangular matrix totally unimodular?
I have a {0,1}, invertible, triangular matrix, that I would like to show is totally unimodular. Are there any known results on the total unimodularity of classes of triangular matrices?
- 1,182
5
votes
1
answer
271
views
Feasibility of linear programs
It's known that finding the intersection of n halfplanes in 2-d takes $\Omega(n\log n)$ time. Does the lower bound apply if we change the question to deciding whether the intersection is non-empty?
- 201
2
votes
0
answers
5k
views
A system of linear equations with linear constraints
Mathematical problem.
Suppose we have $2n$ indeterminates $x_1,\dots,x_n$ and $y_1,\dots,y_n$ (which are denoted by $q$ with indices and called abundances below) and $m$ subsets $P_1,\dots,P_m$ of $\...
7
votes
1
answer
632
views
A variation of Minkowski sum
I have to work with the following variation of Minkowski sum:
Let $\mathbb E$ be a Euclidean space and $K$ be a convex set in $\mathbb E\times \mathbb E$.
Set
$$K^+=\{\\,x+y\in\mathbb E\mid(x,...
- 45k
14
votes
1
answer
587
views
Pushing convex bodies together
Given two convex bodies $A$ and $B$, in $\mathbb R^3$ let's say. We define $A(t)$ and $B(t)$ as $A+xt$ and $B+yt$ where $x,y$ are two arbitrary points. (That is the Minkowski sum, so the two bodies ...
- 85.6k
4
votes
0
answers
790
views
Is it possible to use linear programming to solve this problem?
I am trying to write software to minimize pricing for cell phone subscription services, ie: choose the optimum plan for each customer in a large group.
Could someone comment on whether this is ...
- 41
6
votes
3
answers
2k
views
A simple infinite dimensional optimization problem
I'd be grateful for a reference for the following result, which I believe to be true, and
should be well-known.
Let the continuous functions $f_0,f_1,\cdots,f_n: [0,1]\rightarrow [0,\infty)$ be ...
- 520
13
votes
0
answers
1k
views
Constructive aspects of Caratheodory's theorem in convex analysis
Let me paraphrase Caratheodory's theorem in a probabilistic setup:
Let $X$ be a real-valued random variable. For $k = 1, \ldots, m$, let $f_k: \mathbb{R} \to \mathbb{R}$ be a continuous function such ...
- 1,839
19
votes
3
answers
2k
views
Cutting convex sets
Any bounded convex set of the Euclidean plane can be cut into two convex pieces of equal area and circumference.
Can one cut every bounded convex set of the Euclidean plane into an arbitrary number $...
- 17.9k
4
votes
2
answers
3k
views
Minimum enclosing rectangle of a convex polygon has a collinear side
I've been reading about the rotating calipers algorithm for solving the minimum-area enclosing rectangle problem. It relies on a theorem: The rectangle of minimum area enclosing a convex polygon has a ...
- 139
7
votes
2
answers
2k
views
What is the "Krein-Milman theorem for cones"?
Update: The question is completely answered. I had overlooked a reduction to the self-adjoint case, and the latter can be proved using a Hahn-Banach separation theorem. Thanks to Matthew Daws for ...
- 7,329
29
votes
6
answers
8k
views
How to find a closest integer point to the intersection of two lines?
Here's a question that originates from StackOverflow.
Given are two lines on a plane, specified by equations ($a x + b y = c$) with integer coefficients. The lines aren't parallel and they don't ...
- 391
1
vote
0
answers
1k
views
Covariance matrix formula interpretation - what am I missing?
I'm reading a paper that outlines the calculation of a covariance matrix like the following:
$C=\displaystyle\sum^{N_b}_{i=1}\vec{x}_i\vec{x}_i^T$
What is the order of this matrix? My interpretation ...
- 111
4
votes
1
answer
210
views
Diameter of a metric on orbits under affine bijections of $n-$dimensional convex compact sets
Given two $n-$dimensional convex compact sets $A,B$, we define $d(A,B)$ as $\log({\mathrm{Vol}}(\alpha_2(A)))-\log(\mathrm{Vol}(\alpha_1(A)))$ where $\alpha_1,\alpha_2$ are two affine bijections such ...
- 17.9k
0
votes
2
answers
4k
views
Linear programming piecewise linear objective
I am fairly new at linear programming/optimization and am currently working on implementing a linear program that is stated like this:
max $\sum_{i=1}^{k}{p(\vec \alpha \cdot \vec c_i)}$
$s.t. $
$|\...
- 3
7
votes
2
answers
862
views
Applications of Cauchy's Arm Lemma
Cauchy's Arm Lemma is used in the proof of Cauchy's Rigidity Theorem for convex polyhedra. The Lemma states that in the plane or on the sphere that if all but one of the side lengths of two convex ...
- 153
10
votes
1
answer
2k
views
Sum of difference moduli vs. sum of modulus differences
This is a failed attempt of mine at creating a contest problem; the failure is in the fact that I wasn't able to solve it myself.
Let $x_1$, $x_2$, ..., $x_n$ be $n$ reals. For any integer $k$, ...
- 33.8k
2
votes
1
answer
2k
views
Geometric interpretation of singular values
The singular values of a matrix A can be viewed as describing the geometry of AB, where AB is the image of the euclidean ball under the linear transformation A. In particular, AB is an elipsoid, and ...
- 107
3
votes
1
answer
199
views
Edge-maximizing projective transformation on polytopes
Let P and Q be simple polytopes such that P = Q ∩ H and let H be a halfspace with normal vector n. Let projn(e) denote the length of the projection of edge e onto vector n.
Consider the set E of ...
- 275
5
votes
3
answers
1k
views
Proof that domains of positivity of symmetric nondegenerate bilinear forms are self-dual cones?
Max Koecher (for example, in The Minnesota Notes on Jordan Algebras and Their Applications; new edition: Springer Lecture Notes in Mathematics, number 1710, 1999), defined a domain of positivity for a ...
5
votes
2
answers
457
views
Heaviest Convex Polygon
Suppose we have an arbitrary function $f : \mathbb{R}^2 \to \mathbb{R}$. For any subset $s \subseteq \mathbb{R}^2$, we can define $g_f(s)$ as the integral* of $f$ over the region $s$. Suppose ...
- 341
11
votes
3
answers
1k
views
Continuous automorphism groups of normed vector spaces?
Consider the metric space on, say, ℝ2 induced by the various $L^p$ norms, and the group of isometries from that space into itself that preserve the origin. When $p=2$ I get the continuous group ...
- 180
7
votes
2
answers
1k
views
Maximal Ellipsoid
John's Theorem can be stated as "To every compact, convex body, there is a unique inscribed ellipsoid, whose volume is maximal among all inscribed ellipsoids." It goes on to classify this maximal ...
- 1,588
18
votes
3
answers
3k
views
Deciding membership in a convex hull
Given points $u, v_1, \dots,v_n \in \mathbb{R}^m$, decide if $u$ is contained in the convex hull of $v_1, \dots, v_n$.
This can be done efficiently by linear programming (time polynomial in $n,m$) in ...
- 667
1
vote
1
answer
419
views
Is the direction of the longest line of a polytope unique?
The question pertains to a polytope that is generated by the intersection of an affine subspace with a hypercube in $p$ dimensions.
The affine subspace is given by:
$X \mbox{ u} = y$
where
$u$ &...
- 121
5
votes
0
answers
442
views
Generalizations of generators / hyperplanes descriptions for cones to partially-ordered fields?
Background: given a finite-dimensional real vector space V of dimension d, I can define a pointed cone in two ways: either as a set of the form $\{r_1v_1 + \cdots + r_nv_n \mid r_1, \dots, r_n \in R_{\...
- 10.7k
4
votes
2
answers
3k
views
Break polyhedron into tetrahedron
Given a polyhedron consists of a list of vertices (v), a list of edges (e), and a list of surfaces connecting those edges (...
- 381
44
votes
11
answers
26k
views
Algorithm for finding the volume of a convex polytope
It's easy to find the area of a convex polygon by division into triangles, but what is the optimal way of finding the volume of higher-dimensional convex bodies? I tried a few methods for dividing ...
- 441