Skip to main content

All Questions

Filter by
Sorted by
Tagged with
0 votes
1 answer
28 views

Calculating vertex potentials from optimal matchings

Question: can the solution to the dual of a Linear Program be calculated directly from the solution of the primal Linear Program? If yes, what are known algorithms and their bounds on complexity. As ...
Manfred Weis's user avatar
  • 13.2k
2 votes
1 answer
874 views

Interpreting mincost flow dual variables

Consider the task of finding flow of size $b$ with minimum possible cost. It may be formulated as linear programming in a following way: $$\boxed{\begin{gather} \min\limits_{f_{ij} \in \mathbb R} &...
Oleksandr  Kulkov's user avatar
3 votes
0 answers
282 views

Continuum of Lagrange multipliers, duality gap, and minimax theorem

Suppose I have a linear optimization problem involving random variables on some (infinite) probability space $\Omega$. For example, need to maximize expectation $E[Q]$ of random variable $Q$ subject ...
Bogdan's user avatar
  • 781
2 votes
0 answers
66 views

Proving the existence of a dual for an infinite linear program

I am concerned with proving the existence of the dual of an infinite linear program. In addition to the writings of Rockafellar, Luenberger, and Boyd & Vandenberghe on: subdifferentials, Legendre-...
teddy's user avatar
  • 121
0 votes
1 answer
99 views

Finding dual of a scheduling LP formulation

Suppose I have an LP formulation as such: $\min\ \ \sum\limits_{i,j,t}\ w_{ij}x_{ijt} (\frac{t-r_j}{p_{ij}}+0.5)$ $\sum\limits_{i,t}\frac{x_{ijt}}{p_{ij}}=1\,\forall\ j$ $\sum\limits_{j}x_{ijt}\leq ...
user_1_1_1's user avatar
19 votes
4 answers
1k views

Applications of linear programming duality in combinatorics

So, I know that one can apply the strong LP duality theorem to specific instances of maximum flow problems to recover some nontrivial theorems in combinatorics, such as Hall's theorem, Koenig's ...
amakelov's user avatar
  • 997
1 vote
1 answer
184 views

Do doubly infeasible Linear Programming problems always have doubly infeasible bases?

Consider a Linear Programming problem in dictionary form, $$\max\Big\{f^\pi+\!\!\!\sum_{j\in D(\pi)}\!\! d^\pi_jx_j~\Big|~\forall~i\!\in\!B(\pi)~~~ b^\pi_i+\!\!\!\sum_{j\in D(\pi)}\!\! G^\pi_{ij}x_j\...
Goswin's user avatar
  • 21
1 vote
0 answers
187 views

Strong Duality of Mixed Integer Linear Program

The problem at hand is to optimize a mixed-integer linear program closely related to the maximum flow problem. I would like to reformulate the problem with its dual and I'm concerned with the ...
Amitai G's user avatar
4 votes
2 answers
4k views

Dual Norm For Sum of 2-Norms

What is the dual of a norm that is the sum of two-norms? Specifically, say we have the following norm for $\mathbf{x}\in \mathbb{R}^n$ and $\mathbf{A}_i \in \mathbb{R}^{m \times n}$ $\|\mathbf{x}\| = ...
AnonSubmitter85's user avatar
8 votes
0 answers
1k views

Infinite Linear Programming

I'm trying to prove optimality for a continuous linear program. That is, I have a linear program with an uncountable number of variables and constraints. I'm not sure how to demonstrate feasibility ...
Carrie Nuttall's user avatar
5 votes
2 answers
584 views

Continuous Transportation Problem

Hi all, I'm trying to formulate an infinite linear program to prove optimality (via duality) for the Continuous Transportation Problem, e.g. the Kantorovich-Wasserstein distance. This is the ...
Carrie Nuttall's user avatar