The primal assignment problem that I have is: <mtable columnalign="right left right left righ

Alaina Marshall

Alaina Marshall

Answered question

2022-05-26

The primal assignment problem that I have is:
max i = i N j = 1 N c i j x i j subject to i = 1 N x i j = 1 ,     j = 1 , , N j = 1 N x i j = 1 ,     i = 1 , , N x i , j   { 0 , 1 }
and I would like to obtain its dual, which should be
min p j { i = 1 N p j + i = 1 N max { a i j p j } }
Can you give me any hints on how to approach this derivation? I have tried with Lagrange multipliers but I have not been able to reach this expression.

Answer & Explanation

morssiden5g

morssiden5g

Beginner2022-05-27Added 9 answers

I don't know why you want to transform a standard LP problem, as the dual of the AP is, into a min-max problem.

Anyway the transformation should be as follows.

Let α j ,   j = 1 , , N be the dual multipliers associated to the first set of constraints and β i ,   i = 1 , , N those associated to the second set of constraints. Then, the ordinary dual is
min α , β   j = 1 N α j + i = 1 N β i α j + β i c i j       i , j = 1 , , N
Observe now that
β i c i j α j     i , j = 1 , , N     β i = max 1 j N { c i j α j }     i = 1 , , N
Hence we get
min α   j = 1 N α j + i = 1 N max 1 j N { c i j α j }

Do you have a similar question?

Recalculate according to your conditions!

New Questions in High school geometry

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?