BUAN 3066 Exam 2

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/48

encourage image

There's no tags or description

Looks like no tags are added yet.

49 Terms

1
New cards

Feasible Region

location of all possible combinations of decision variables (x1, x2, etc) that satisfy the constraints

2
New cards

Optimization

Finding the point within the feasible region that maximizes or minimizes the objective function

3
New cards

Objective Function

A linear function comprised of two decision variables that is to be maximized or minimized according to the constraints.

Moves in a constant direction on the graph to intersect with the feasible region

4
New cards

Optimal value

The maximized or minimized value, it occurs at one of the extreme points (corner points) of the feasible region

5
New cards

How to find the Optimal Solution

1. Identify all corner points. 2. Compute the objective function at each point. 3. Pick the point with the optimal value


6
New cards

Infeasible Problem

no optimal solution exists —> No feasible region

7
New cards

How can we get multiple Optimal Solutions?

When the objective function has the same slope as one of the constraint boundaries.

Objective line slides along the boundary edge, producing multiple optimal points

All points on that boundary yield the same optimal value

8
New cards

Unbounded Problem

Occurs when the feasible region extends indefinitely in the direction of optimization

Indicates one or more constraints are missing or incorrectly specified

9
New cards

Sensitivity Analysis

Studies how changes in the parameters of an optimization model affect the optimal solution

Tests the robustness of the solution

Helps understand how much an input can change before the current solution is no longer optimal

10
New cards

Binding Constraint

A limit that the optimal solution satisfies precisely, leaving no slack.

Slack = 0 —> all available resources are fully used

11
New cards

Non-binding Constraint

A limit that has leftover capacity or unused resources, leaving slack

Slack > 0 —→ Changing RHS (right hand side) formula (within allowable range), without changing the objective value

Shadow price = 0 (sufficient condition)

12
New cards

Shadow Price

The change in the optimal objective value per 1-unit increase in RHS of a binding constraint

13
New cards

All Integer Optimization

all decision variables must be integers

14
New cards

Mixed Integer Optimization

some variables are integers, others are continuous

15
New cards

Binary Integer

variables take any values 0 or 1

16
New cards

LP Relaxation

integer restriction is removed to find approximate solution

17
New cards

Integer Programming

specialized algorithms that find optimal integer solutions

18
New cards
19
New cards

Linear Optimization

changes in inputs produce proportional changes in outputs

efficient and scalable

20
New cards

Nonlinear Optimization

Changes in input are not proportional

may have multiple local optima, which makes it harder to solve

21
New cards

local optimum

feasible solution where no nearby feasible point provides a better objective value

22
New cards

Local maximum

no neighboring feasible solution gives a LARGER objective value

23
New cards

Local minimum

no neighboring feasible solution gives a SMALLER objective value

24
New cards

global optimum

feasible solution where no other feasible solution within the feasible region gives a better objective value

25
New cards

Global maximum

no other solution gives a LARGER objective value

26
New cards

Global minimum

no other solution gives a SMALLER objective value

27
New cards

Concave function

bowl-shaped down, used in maximization problems

28
New cards

Convex function

bowl-shaped up, used in minimization problems

29
New cards

GRG Nonlinear Solver Method

searches locally for an optimum

suitable for smooth, differentiable nonlinear problems

30
New cards

Multistart Solver Option

Helps identify global optimum

runs solver from multiple starting points

Solver generates random starting values within the variable bounds

reports the objective value after testing all runs

31
New cards

Location model

determines where to place one or more facilities to achieve a desired objective

32
New cards

continuous location model

facility can be placed anywhere within a set space

33
New cards

discrete location model

facility must be chosen from a finite set of candidate sites

34
New cards

Median models

minimize the total weighted distance

35
New cards

Center models

minimize the maximum distance

36
New cards

Location Covering Models

Maximize the geographical amount of demand served within a target radius

37
New cards

Forecasting error

The difference between the actual observed value and the forecasted value

38
New cards

Product diffusion

the process of a new product spreading through the market over time

39
New cards

Bass Forecasting Model

describes how new products are adopted over time

40
New cards

Innovator

behavioral variable that is influenced by external factors

41
New cards

Imitator

behavioral variables that is influenced by social contagion or work-of-mouth

42
New cards

Portfolio Optimization Problem

determines how to allocate wealth across a set of assets, with the goal of choosing investment weights (how much to put into each investment)

43
New cards

Markowitz Portfolio Model

balances risk and return, with the objective of minimizing portfolio risk (variance)

44
New cards
45
New cards
46
New cards
47
New cards
48
New cards
49
New cards