stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Math Programming Exam I Review Flashcards | StudBud
Explore
/
Math Programming Exam I Review
Math Programming Exam I Review
10 terms
·
StudBud Administration
·
49 plays
Review Concepts for Math Programming Exam I
Flashcards
10 cards
F
Practice quiz
P
Host live
L
Questions
10
Answers
1
This constraint implies decision variables can only be 0 or positive values.
optimal constraint
objective constraint
non-negativity constraint
negativity constraint
2
A linear program allows for integer and non-integer decision variable values.
False
True
3
Which of the following is NOT a property of Linear Programs
non-linearity
Additivity
Proportionality
Divisibility
4
This algorithm systematically searches the feasible region for the optimal solution.
Integer Program
Feasibility Algorithm
Simplex Algorithm
Sample Algorithm
5
Which constraints are considered
binding constraints
?
Cost and Stretch Avail
Regular Avail Only
Cost Only
Stretch Avail and Regular Avail
6
The purple highlighted region represents the
set of optimal solutions
feasible region
infeasible region
concave set of points
7
The following Simplex Tableu is for a minimization LP model. At this stage the solution is _______ and _______.
multi-optimal optimal, feasible
optimal, unbounded
not optimal, infeasible
optimal, infeasible
8
Artificial variables are added to >= and = constraints to form a basis
False
True
9
Definition:
Choices that are available to the decision maker (how much/how many)
Decision Variables
Goal(s)
Objective(s)
Constraints
10
What are the non-basic variables?
X1, X2
E1,E2,S1,S2,A1,A2
E1,E2,S2,A2
X2,A1,S1,X1
