Question: Suppose there is a Maximization linear program where all the decision variables are constrained to be 0. There are p constraints of the form 5,
Suppose there is a Maximization linear program where all the decision variables are constrained to be 0. There are
p constraints of the form 5,
q constraints of the form = 7 and
r constraints of the form 8.
(So there are p + q + r functional constraints in total).
If it is to solve with the big-M method, the Simplex tableau is set up to obtain the initial, artificial basic feasible solution.
(a) What will the Z value (i.e. the objective function value) be of the initial, artificial basic feasible function, expressed as a function of p, q, r and M? Describe this.
(b) Consider the initial, artificial basicfeasible solution. Which variables will be in the basis? What will their values be?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
