Civil Infrastructure Systems-Module 6

Primary tabs

No Description Set

Bookmark to learn: Login to use bookmarks.

Bookmark to learn: Login to use bookmarks.

Add to collection ... add Civil Infrastructure Systems-Module 6 to your collections:

Help using Flashcards ...just like in real life ;)

  1. Look at the card, do you know this one? Click to flip the card and check yourself.
  2. Mark card Right or Wrong, this card will be removed from the deck and your score kept.
  3. At any point you can Shuffle, Reveal cards and more via Deck controls.
  4. Continue to reveal the wrong cards until you have correctly answered the entire deck. Good job!
  5. Via the Actions button you can Shuffle, Unshuffle, Flip all Cards, Reset score, etc.
  6. Come back soon, we'll keep your score.
    “Repetition is the mother of all learning.”
  7. Signed in users can Create, Edit, Import, Export decks and more!.

Bookmark to learn: Login to use bookmarks.

Share via these services ...

Email this deck:

Right: #
Wrong: #
# Right & # Wrong of #

Introduction to Goal Programming

• Multiple conflicting objectives
–Reduce national debt
–Income tax relief
• Obtain compromise solution
• Try to “satisfy” goals rather than optimize

Goal

- an objective in conjunction with an aspiration level

Examples:
– Achieve at least $20,000 in profit
– Reduce emissions by 50%

Goal Deviation

difference between what is
aspired to and what is accomplished with
objective

Visualize Goal Deviation with slack

Goals act as constraints in the GP
– Advantages

– Allows multiple objectives
– Allows slack in the constraint (not hard)

Goals act as constraints in the GP
– Disadvantages

– Complexity of the “overall objective”
– Must elicit goal values (and weights) from Decision Maker
– Must find a way to homogenize these values

Solving Goal Programs

• Weights Method
• Preemptive Method
• Taha’s Method

Weights Method

• Single objective function is the weighted sum of the functions representing the goals
min z = w1G1 + w2G2 +...+ wnGn

Preemptive Method

• Prioritize goals in order of importance
• Model optimized with one goal at a time
–Higher priority goal never degraded by lower priority goal

Steps in Taha's Approach

Step 0: Rank goals in order of priority
Step 1: Solve LP that minimizes Gi

Taha's Approach Step 0: Rank goals in order of priority

G1 = p1>G2 = p2>...Gn = pn
s
-set i = 1

Taha's Approach Step 1: Solve LP that minimizes Gi

– pi = pi* denotes optimum value of deviational variable
– If i = n, stop
– Else, add constraint to the constraints of the Gi problem to ensure value of ri not degraded in future problems
• Seti=i+1

Formulation

Front image: 
Back image: 

Solve LP1

Front image: 
Back image: 

Solve LP2

Front image: 
Back image: 
Front image: 
Back image: 
Front image: 
Back image: 
Front image: 
Back image: