Consider the following problem. Maximize Z = c1x1 + c2x2, Subject to and x1 ¥ 0, x2
Question:
Maximize Z = c1x1 + c2x2,
Subject to
and
x1 ¥ 0, x2 ¥ 0.
Let x3 and x4 denote the slack variables for the respective functional constraints. When c1 = 3, c2 = 2, b1 = 30, and b2 = 10,
the simplex method yields the following final simplex tableau.
I (a) Use graphical analysis to determine the allowable range for c1 and c2.
(b) Use algebraic analysis to derive and verify your answers in part (a).
I (c) Use graphical analysis to determine the allowable range for b1 and b2.
(d) Use algebraic analysis to derive and verify your answers in part (c)
C (e) Use a software package based on the simplex method to find these allowable ranges.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction to Operations Research
ISBN: 978-1259162985
10th edition
Authors: Frederick S. Hillier, Gerald J. Lieberman
Question Posted: