Correct Answer
verified
View Answer
Multiple Choice
A) all-integer linear program
B) mixed-integer linear program
C) LP relaxation of the integer linear program
D) binary integer linear program
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Multiple Choice
A) For integer linear programs involving minimization, the value of the optimal solution to the LP Relaxation provides an upper bound on the value of the optimal integer solution.
B) For integer linear programs involving maximization, the value of the optimal solution to the LP Relaxation provides a lower bound on the value of the optimal integer solution.
C) For integer linear programs involving minimization, the value of the optimal solution to the LP Relaxation provides a lower bound on the value of the optimal integer solution.
D) For any linear program involving either minimization or maximization, the value of the optimal solution to the LP Relaxation provides an infeasible value for the optimal integer solution.
Correct Answer
verified
Multiple Choice
A) Min(∑xi)
B) Max(∑xi)
C) Min(πxi)
D) Max(πxi)
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Multiple Choice
A) Conditional constraint
B) Corequisite constraint
C) k out of n alternatives constraint
D) Mutually exclusive constraint
Correct Answer
verified
Multiple Choice
A) nonnegativity constraints are needed.
B) variables can take negative values.
C) the decision variables cannot take fractional values.
D) possible values of variables are restricted to particular intervals.
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Multiple Choice
A) capital budgeting problem
B) share of choice problem
C) fixed-cost problem
D) traveling-salesman problem
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Multiple Choice
A) conditional constraint
B) corequisite constraint
C) k out of n alternatives constraint
D) mutually exclusive constraint
Correct Answer
verified
Essay
Correct Answer
verified
View Answer
Multiple Choice
A) Part-worth analysis
B) Conjoint analysis
C) Regression analysis
D) Sensitivity analysis
Correct Answer
verified
Multiple Choice
A) convex hull
B) a mixed-integer linear program
C) LP relaxation
D) a binary integer linear program
Correct Answer
verified
Multiple Choice
A) upper bound for the corresponding production variable.
B) upper bound for each of the binary variable.
C) integer constraints involving the corresponding production variables.
D) objective function involving these binary variables only.
Correct Answer
verified
Multiple Choice
A) cutting plane
B) trial-and-error
C) breaking region
D) branch-and-bound
Correct Answer
verified
Multiple Choice
A) Capital budgeting problem
B) Covering problem
C) Fixed-cost problem
D) Product design and market share optimization problem
Correct Answer
verified
Multiple Choice
A) concave hull
B) slope
C) convex hull
D) geometry
Correct Answer
verified
Multiple Choice
A) location variables
B) noninteger constraints
C) objective function coefficients
D) binary variables
Correct Answer
verified
Showing 21 - 40 of 60
Related Exams