COMMERCE 3QA3 Midterm: brs_mdm3_tif_ch06

• School: McMaster University
• Department: Commerce
• Course: COMMERCE 3QA3
• Professor: Mandeep Malik

Document Summary

Chapter 6 integer, goal, and nonlinear programming models. 6. 1 chapter questions: these are problems in which some, but not all, the decision variables must have integer solutions, mixed ip problems, pure ip problems, pure binary problems, mixed binary ip problems, goal programming problems. Difficulty: easy: these are problems in which all decision variables must have integer solutions, mixed binary ip problems, pure binary ip problems, mixed ip problems, pure ip problems, goal programming problems. Difficulty: easy: rounding off the solution to an lp relaxed problem may yield, an infeasible solution, a non-optimal solution, a higher objective function value, an unbounded solution, a or b. 1: a company wants to select 2 products from a set of four possible products. Difficulty: moderate: a company wants to select one product from a set of 3 possible products. Difficulty: moderate: which type of cost is independent of the volume of production, inventory cost, marginal cost, sunk cost, variable cost, fixed charge.