Chapter 2 Flashcards

1
Q

Linear Programming Model Objective

A

Maximize or Minimize and linear objective function subject to set of linear constraints

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Characteristic of LPM (4)`

A

decision variables
linear objective function
linear constraints
non negative decision variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Objective function (2)

A

maximize profit or minimize cost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Applicability

A

real world applications of LPM

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Solvability

A

theoretically and practically efficient techniques for solving large scale problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

LP is central topic in…..

A

optimization

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Standard form

A

all system constraints written as equalities

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Optimal solution of standard form and optimal solution of Linear programming model

A

they are equal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Slack variable
what is
when added
symbol

A

amount of unused resource
added to left side of equation when less than or equal to <=
+S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Surplus variable
what is
when added
symbol

A

amount over and above required amount
added to left side of equation when greater than or equal to >=
-S

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Cost of surplus and slack is

A

0 zero

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Binding constraint (3)

A

passes through optimal solution
left hand side of equation = right hand side of equation for constraint
slack/surplus = 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Non-Binding Constraint (3)

A

does not pass through optimal solution
left hand side and right hand side are unequal of constraint
slack/surplus > 0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

binding is also called ____ constraint

A

active

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

non binding is also called _____ constraint

A

non-active

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Graphical solution possibilites (3)

A

one feasible solution
no feasible solution
infinite number of feasible solutions

16
Q

Feasible Solution and where on graph

A

satisfies all constraints, area on graph bounded

17
Q

feasible region

A

set of all possible feasible solutions, contains all feasible and optimal solutions

18
Q

infeasible

A

no feasible solutions, region is empty

19
Q

Optimal solution

A

best possible value of objective function, best feasible solution

20
Q

Linear program model may have _______ _______ solutions but only ______ ________ solution value

A

Linear program model may have multiple optimal solutions but only one optimal solution value

21
Q

optimal solution mazimize

A

last point objective function touches as it leave feasible solution area (away from origin)

22
Q

optimal solution minimize

A

extreme point closest to the origin

23
Q

Alternative Optimal Solution

A

more than one solution provides optimal value for objective function

24
Q

unbounded

A

value of solution is made infinitely large in a maximize problem or infinitely small in minimize problem without violating constraints

25
Q

Extreme points

A

vertices or corners of feasible region