Lecture Notes on Conversions | Linear Programming and Network Flows | MATH 444, Study notes of Mathematics

Material Type: Notes; Class: Linear Programming and Network Flows; Subject: MATHEMATICAL SCIENCES; University: Northern Illinois University; Term: Unknown 1989;

Typology: Study notes

Pre 2010

Uploaded on 08/18/2009

koofers-user-rz6
koofers-user-rz6 🇺🇸

10 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
6 Conversions.
6.1 Minimization-maximization.
Consider a real-valued function :fCR defined on some set C. Let :gCR be given by
() ()
gx fx=. If ˆ
xC is a maximizer of f, then ˆ
x is a minimizer of g. To see this, observe
that
() ()
() ()
ˆˆ
gx fx fx gx=−≤=
for all xC.
Exercise
Show that if ˆ
xC is a minimizer of :fCR, then ˆ
x is a maximizer of :gCR, where g
is given by
() ()
gx fx=.
6.2 Reversal of inequalities.
Inequalities of the form ax b are converted to the standard form by multiplying both sides by
1.
Exercise
First convert the standard dual problem to a standard primal problem. Next take the dual of the
converted problem. Do you recognize this problem?
6.3 Splitting equalities.
Equalities of the form Dx e= split into a pair Dx e and Dx e. In the primal problem this
pair appears as
Dx e
Dx e
−≤
.
It is of course possible to use the system Dx e= and solve for some of the variables i
x in terms
of the others and then replace the i
x throughout the problem.
6.4 Unrestricted variables.
The restriction that all variables are non-negative is possible to circumvent by increasing the
number of variables. Suppose that i
x is allowed to be both positive and negative. Introduce
0
i
p and 0
i
n. Replace i
x throughout the problem with iii
xpn=. Observe how the
linearity is retained. In this way each converted unrestricted variable increases the dimension by
1.
pf2

Partial preview of the text

Download Lecture Notes on Conversions | Linear Programming and Network Flows | MATH 444 and more Study notes Mathematics in PDF only on Docsity!

6 Conversions.

6.1 Minimization-maximization.

Consider a real-valued function f :C → R defined on some set C. Let g :C → R be given by g (^ x )^ = − f (^ x). If xˆ ∈ C is a maximizer of f , then xˆ is a minimizer of g. To see this, observe that g ( xˆ ) = −f ( xˆ ) ≤ −f (^ x )^ =g (^ x) for all x ∈ C.

Exercise Show that if ˆx ∈ C is a minimizer of f :C → R , then ˆx is a maximizer of g :C → R , where g is given by g (^ x )^ = −f (^ x).

6.2 Reversal of inequalities.

Inequalities of the form ax ≥ b are converted to the standard form by multiplying both sides by − 1.

Exercise First convert the standard dual problem to a standard primal problem. Next take the dual of the converted problem. Do you recognize this problem?

6.3 Splitting equalities.

Equalities of the form Dx = e split into a pair Dx ≤ e and Dx ≥ e. In the primal problem this pair appears as Dx e Dx e

It is of course possible to use the system Dx = e and solve for some of the variables xi in terms of the others and then replace the xi throughout the problem.

6.4 Unrestricted variables.

The restriction that all variables are non-negative is possible to circumvent by increasing the number of variables. Suppose that xi is allowed to be both positive and negative. Introduce pi ≥ 0 and ni ≥ 0. Replace xi throughout the problem with xi = pi − ni. Observe how the linearity is retained. In this way each converted unrestricted variable increases the dimension by

Exercise Consider the problem

1 1 2 2 1

max 2 when 5 0

x x x x x

Convert this problem to a standard primal problem.