{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 331-14 - Chapter 6 Integer and Goal Programming...

This preview shows pages 1–10. Sign up to view the full content.

Chapter 6 Integer and Goal Programming Models (cont’d) (Using Binary constraints; Goal Programming)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
What is a BINARY Constraint? A special case of Integer constraint A “Binary” is an integer value that can be ONLY either 0 or 1 A Binary is most often used as a logical indicator where NO = 0 and YES = 1, or in corresponding terms 0 = Do not include and 1 = Include The Solver pull-down menu for the sign of a Constraint includes an option of: BIN for Binary
Binary Integer Example: Portfolio Selection Choosing stocks to include in portfolio Decisions: Which of 7 stocks to include? We either buy a block of shares or not; we do not buy part of a block Objective: Maximize expected annual return (in \$1000’s)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Restrictions Invest up to \$3 million Include at least 2 Texas companies Include no more than 1 foreign company Include exactly 1 California company If British Petro is included, then Trans-Texas Oil must also be included
Decision Variables Use the first letter of each stock’s name Example for Trans-Texas Oil: T = 1 if Trans-Texas Oil is included T = 0 if not included This is an example of using Binary constraints to impose Logic conditions.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Objective Function (in \$1000’s return) Max 50T + 80B + 90D + 120H + 110L + 40S + 75C Subject to the constraints: Invest up to \$3 Million 480T + 540B + 680D + 1000H + 700L + 510S + 900C < 3000 (Remember why we do not use “ = “ ?)
The remaining constraints are all logic relationships that require the use of BINARY Include At Least 2 Texas Companies T + H + L > 2 Include No More Than 1 Foreign Company B + D < 1 Include Exactly 1 California Company S + C = 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
How do we go from Logic relationship into a Binary Constraint Identify ALL the possible combinations Use trial and error to define the relationship that satisfies all these conditions. Which one of the following is valid for the Foreign Company constraint? (Not all possibilities are included.) B + D = 0 B + D = 1 B – D = etc… B + D ≥ 0 B + D ≥ 1 B + D 0 B + D ≤ 1
“Include no more than one foreign company” D=0 D=1 B=0 ok ok B=1 ok NOT ok

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}