0 Up votes0 Down votes

3 views2 pagesApr 14, 2011

© Attribution Non-Commercial (BY-NC)

PDF, TXT or read online from Scribd

Attribution Non-Commercial (BY-NC)

3 views

Attribution Non-Commercial (BY-NC)

- UC
- IJETTCS-2018-05-01-1
- International Journal of Mathematical Combinatorics, Vol. 4, 2010
- ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
- Line Balancing
- Alkhawarizmi2011 ACMICPC Malaysia
- Studies on Network Design Problems
- Graph Terminology
- Goal Programming
- Graph Theory Paths and Cycle
- G Chapter One
- adjescency matrx
- MOSEK
- 5 Graph Theory
- ei201005.pdf
- Journal of EAST 2017
- Week 8
- Bi-level Linear Programming Problem with Neutrosophic Numbers
- lec 1 intro to OT
- chapter6-part3

You are on page 1of 2

1. (a) Do Exercise 2.39 from the textbook. Assume that the only optimization tool that you have

is a solver for LPs (Linear Programs), and you must be able to solve your formulation.

(b) Bring the LP formulation(s) of the previous part into standard form and give their dual(s).

(c) Bring the dual LPs of the previous part in standard form.

2. As you already know, graphs (directed or undirected) are widely used to model different settings,

and then the original problem is reduced to the solution of a graph problem. Here is a graph:

Its set of nodes is {s, v1 , v2 , . . . , vM , u1 , u2 , . . . , uM , t1 , t2 , . . . , tk } (note that every node ti , i =

v1 µ1 u1

∞

.

. ∞ t1

∞ .

.

s ∞

∞ vj uj

µj

∞ . ∞

.

. ∞ tK

µM ∞

vM uM

subset of V , and it partitions the graph into two parts S, S̄ = V \ S. If the graph is undirected

then we denote by δ(S) the edges that cross the cut S, i.e.

For example, if you assume for the moment that the edges of the graph in Figure 1 are undirected,

and S = {s} then δ(S) = {(s, vi ) : i = 1, . . . , M }. If the graph is directed, then we denote by

δ+ (S) the edges that leave the cut S, and by δ− (S) the edges that enter the cut S. For example,

in the directed graph of Figure 1, if we consider again the cut S = {s}, then δ+ (S) = {(s, vi ) : i =

1, . . . , M }, and δ− (S) = ∅. For simplicity, if w ∈ V is a node, then we denote by δ+ (w), δ− (w)

the sets δ+ ({w}), δ− ({w}).

(a) How many cuts are there in a graph with n nodes? (Note that we don’t count the sets ∅, V

as cuts.)

(b) Suppose that the numbers µj in Figure 1 are positive, and ∞ stands for a very big positive

P

number C, bigger than M j=1 µj . Let ukl be µj if k = vj , l = uj , and C if k = s, l = vj , j =

1, . . . , M or k = uj , l = ti , j = 1, . . . , M, i = 1, . . . , K (i.e., uij is the number you see on edge

1

(i, j) in Figure 1.) Consider the following LP, with one variable xe for every edge e ∈ E 1 :

P

max e∈δ+ (s) xe s.t.

P P

x

e∈δ+ (v) e − x

e∈δ− (v) e = 0, for all v ∈ V \ {s, t1 , t2 , . . . , tK }

xij ≤ uij , for all (i, j) ∈ E

xij ≥ 0, for all (i, j) ∈ E

i. How many variables, and how many constraints are there in the LP above (excluding

the last set of lower bound constraints)?

ii. Bring the LP in standard form and give its dual.

iii. Where did that LP come from? In other words, give a ”real-world” problem that can

be modeled by this LP. (hint: Assume that the original problem came from an Alberta

oil pipeline company.)

iv. This LP formulation can be applied to any directed graph G = (V, E) with a definition

of uij for every (i, j) ∈ E. With specific values for these u’s you can use any LP solver

to find the optimum. But for the specific graph of Figure 1 one can guess the optimum

value without using a solver. Can you? (Of course you can, but I want you to also

write down the value of the optimum, and why you think it is really the optimum).

1

We denote the variable corresponding to edge e = (i, j) sometimes by xe and sometimes by xij . It is the same

variable in both cases.

- UCUploaded byMuhammad Asghar Khan
- IJETTCS-2018-05-01-1Uploaded byAnonymous vQrJlEN
- International Journal of Mathematical Combinatorics, Vol. 4, 2010Uploaded byAnonymous 0U9j6BLllB
- ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHSUploaded byAnonymous 0U9j6BLllB
- Line BalancingUploaded byfoofool
- Alkhawarizmi2011 ACMICPC MalaysiaUploaded bywazazzu3349
- Studies on Network Design ProblemsUploaded byPedro
- Graph TerminologyUploaded byLiew Soung Yue
- Goal ProgrammingUploaded byrajivkumar2oct
- Graph Theory Paths and CycleUploaded byNeilAngeloFullente
- G Chapter OneUploaded byammalai
- adjescency matrxUploaded bytigersayooj
- MOSEKUploaded byTranThang09
- 5 Graph TheoryUploaded byGian Salle
- ei201005.pdfUploaded byIuliu Damian
- Journal of EAST 2017Uploaded byLe Thu Huyen
- Week 8Uploaded byrafiqueuddin93
- Bi-level Linear Programming Problem with Neutrosophic NumbersUploaded byMia Amalia
- lec 1 intro to OTUploaded byM.asif
- chapter6-part3Uploaded byPranav Latkar
- PaperUploaded byvermatiet
- Goal Programming 1Uploaded byAnas Mostafa
- 5214vlsi01Uploaded bySasi Kiran S
- Final NotesUploaded byMarlee
- QTUploaded bysameersinghcool4u_83
- 07Uploaded byziaullah khan
- Transportation AssignmentUploaded byMaaz Kazi
- documentUploaded bytarun sai
- A Mixed Integer Programming Model Formulation for Solving the Lot-Sizing ProblemUploaded byastariwulandari
- Anonymous Secret Sharing SchemesUploaded byΟλυμπίδης Ιωάννης

- Frontline Solvers User GuideUploaded byedwinap75
- Premium Solver Version 5.5Uploaded byKonrad Podsadny
- Lingo_16_Users_Manual.pdfUploaded byEduardo Scheel
- 7eCh15Uploaded byAnonymous ZZdC9CJG
- MB0048- Descriptive Practice QPUploaded byTina Thomas
- TSPUploaded bySri Hari Charan
- Taylor Mgmt-science10 Tif 03Uploaded byBatuhan Bardak
- AEA HS17 Optimization&LCAUploaded byÁngel Galvis C
- Math 540 Week 9 Quiz 5Uploaded byGaryoFrobon
- ps1Uploaded byEhsan Spencer
- Balcik and Beamon 2008Uploaded byLuís Filipe Costa
- Readme.cplexUploaded byChristian Bennett
- M4L4_LNUploaded byswapna44
- gmplUploaded bymatejkahu
- Manitoba Hydro's SPLASH ModelUploaded byMarc Tablan
- 1992. Laporte - TSP review.pdfUploaded byIng Vmnr
- ESI4312-Spring2014-Syllabusb(1)Uploaded bySieggy Bennicoff Yundt
- Formatted Thesis for PDFUploaded bySanjay Tiwari
- A 472308Uploaded byPrem Shankar
- NaUploaded byarulmurugu
- L4-Lp Standard FormUploaded byErwin D. Osorio
- 59.317549Uploaded byZaheer Abbas
- Reveiw of Personal SchedulingUploaded byajaymechengineer
- Linear Programming - Sensitivity Analysis - Using SolverUploaded byAmit Maheshwari
- 44480542 LP Formulation Problems and SolutionsUploaded byShahab Aftab
- 10.1.1.62.5521Uploaded byroyfantasma
- Notes on GAMS for Optimization by Ronald L. Rardin MayUploaded bynouraaldhaheri
- LP Sparse Spike Impedance InversionUploaded byNur Arasyi
- FREIGHT_ROUTING_AND_CONTAINERIZATION_IN.pdfUploaded byNAEEM SHUJA
- 3. Solid Object.pdfUploaded bySajedur Rahman Mishuk

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.