DOC PREVIEW
UT Dallas CS 6385 - assn1

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1. You may use lp_solve program - a free-ware. You can download it from thefollowing web site: http://lpsolve.sourceforge.net/5.5/ 2. If you want to use some other lp solver that is fine. 3. Solve the following problem and write a report: a. What tool you are using (eg. lp_solve) ? b. features of the tool you are using (as for as lp program solving is concerned). c. The number of nodes for the following program should be at least 10. d. The number of edges should be at least 20. e. Assign some capacity to eache edge. f. Assign a unit cost for capacity. g. assign unit profit. Hint: Formulate it first as optimizing the ratio of two linear functions under linear constraints. This is still not an LP, since the objective function is a fraction. Then convert it into an LP in two steps, using the following idea. * A telecommunications company sets up routes through its network to servecertain source-destination (S-D) pairs of traffic. We want to assign bandwidth to each route, under the following conditions: The routes are fixed and known in advance, each route goes through a known set of links. (These sets can possibly overlap, as the routes may share links.) Each link has a known available capacity, which cannot be exceeded by the routes that use the link, in the sense that the sum of the route bandwidths on the link cannot be more than the link capacity. Assigning bandwidth to a route has a cost. This cost is proportional to the bandwidth assigned. The cost of unit bandwidth is known for each route (may be different for different routes). Each route generates a profit, due to the traffic it carries. The profit of each route is proportional to the bandwidth assigned to the route. The profit generated by unit bandwidth is known for each route (may be different for different routes). Under the above conditions, the company wants to decide how much bandwidth to assign to each route. The goal is that the ratio of the total profit vs. the total cost is maximized. In other words, they want to maximize the yield of the bandwidthinvestment in the sense that it brings the highest profit percentage. Formulate thisoptimization problem as a linear


View Full Document

UT Dallas CS 6385 - assn1

Documents in this Course
38rel2

38rel2

5 pages

Report

Report

3 pages

networks

networks

18 pages

lp2

lp2

44 pages

lp2 (2)

lp2 (2)

27 pages

lp1(1)

lp1(1)

21 pages

integer1

integer1

50 pages

FrankR2

FrankR2

3 pages

duality

duality

28 pages

CMST

CMST

44 pages

hw4

hw4

3 pages

for 1

for 1

11 pages

ENCh02

ENCh02

33 pages

pree

pree

2 pages

new  3

new 3

2 pages

new  2

new 2

2 pages

hw4a

hw4a

2 pages

T2_Sol

T2_Sol

4 pages

ISM3

ISM3

8 pages

hw4_sol

hw4_sol

6 pages

Elm04_06

Elm04_06

11 pages

atn proj2

atn proj2

20 pages

12CUT1

12CUT1

8 pages

09Ford

09Ford

23 pages

08FLOW

08FLOW

6 pages

03LP_su

03LP_su

6 pages

40REL40

40REL40

5 pages

39rel3

39rel3

5 pages

38arel2

38arel2

5 pages

37REL1

37REL1

3 pages

24TABU

24TABU

3 pages

22DYNPR

22DYNPR

3 pages

21B&C

21B&C

2 pages

20BBEX0

20BBEX0

3 pages

19BB

19BB

5 pages

14CAPBUD0

14CAPBUD0

11 pages

35BRXCH

35BRXCH

2 pages

34COMB

34COMB

4 pages

32CAPAS

32CAPAS

4 pages

31QUEUE

31QUEUE

3 pages

Load more
Download assn1
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view assn1 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view assn1 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?