BU275 Study Guide - Midterm Guide: Feasible Region, 2Pm, Dont
Document Summary
Chapter 2: linear programming - introduction and graphical solution. Build and sell; chairs (profit: ) and tables (profit ) Chair: 3 large blocks, 2 medium blocks, 2 small blocks. Table: 2 large blocks, 2 medium blocks, 4 small blocks. There are only 12 large blocks [4-by-2 blocks] There are only 8 medium blocks [4-by-1 blocks] There are only 10 small blocks [2-by-2 blocks] The best way to determine the decision variables is to put oneself in the shoes of the de(cid:272)isio(cid:374) (cid:373)ake(cid:396) a(cid:374)d the(cid:374) ask the (cid:395)uestio(cid:374) (cid:862)what do i (cid:374)eed to k(cid:374)o(cid:449) i(cid:374) o(cid:396)de(cid:396) to (cid:373)ake this thi(cid:374)g (cid:449)o(cid:396)k? (cid:863) Decision variables: c = # of chairs and t = # of tables. There are only 12 large blocks [4-by-2 blocks]; (cid:1007)c + (cid:1006)t (cid:1005)(cid:1006) There are only 8 medium blocks [4-by-1 blocks]; (cid:1006)c + (cid:1006)t 8. There are only 10 small blocks [2-by-2 blocks]; (cid:1006)c + (cid:1008)t (cid:1005)(cid:1004) Objective function and constraints are linear functions.
