Use graphical methods to solve each linear programming problem.
You are given the following linear programming problem:*
Maximize z = c1x1 + c2x2
subject to; 2x1 + x2 ≤ 11
–x1 + 2x2 ≤ 2
x1 ≥ 0, x2 ≥ 0.
If c2 > 0, determine the range of c1/c2 for which (x1, x2) = (4,3) is an optimal solution. (Choose one of the following.) Source: Society of Actuaries.
(a) [–2, 1/2]
(b) [–1/2, 2]
(c) [–11, –1]
(d) [l, 11]
(e) [–11, 11]
Want to see the full answer?
Check out a sample textbook solutionChapter 3 Solutions
Finite Mathematics (11th Edition)
Additional Math Textbook Solutions
Using & Understanding Mathematics: A Quantitative Reasoning Approach (7th Edition)
Introductory Mathematics for Engineering Applications
MATH IN OUR WORLD (LOOSELEAF)-W/ACCESS
Calculus for Business, Economics, Life Sciences, and Social Sciences (14th Edition)
Introductory Combinatorics
Finite Mathematics with Applications In the Management, Natural, and Social Sciences (12th Edition)
- College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning