Simplex Method

(c) Each problem does not have a dual.
(d) Both the primal and the dual are either maximisation or minimisation
problems.
7. Right-hand side ranging is used to determine:
(a) The availability of resources.
(b) The requirement of resources.
(c) The range of the resource availability over which the solution remains the
same.
(d) The range of the resource availability over which the shadow prices
remain constant. Right-hand side ranging can
8. be determined by:
(a) Dividing the Cj - Zj row with the Zj row.
(b) Dividing the quantity column by the column representing the slack of the
variable whose range we are determining.
(c) Dividing the quantity column with the column of the incoming variable.
(d) None of the above.
9. In the simplex procedure:
(a) Each successive tableau presents a solution superior to the one preceding it.
The number of tableaus is determined by the number of constraints.
(b) The number of tableaus is determined by the number of variables. None of
(c) the above.
(d) 10.
Artificial variables are required:
(a) Only in a minimisation problem.
(b) Only in a maximisation problem.
(c) To convert inequalities of the 'greater than or equal to' type into equalities.
(d) To convert inequalities of the 'less than or equal to' type into equalities.
1.
2.
3.
4.
5.
6.
7.
QUESTIONS
Explain various steps of the simplex method involved in the computation
of an optimal solution to a linear programming problem.
Define slack and surplus variables in a linear programming
problem. Explain the primal dual relationship.
Explain the meaning of basic feasible solution and degenerate solution
in a linear programming problem.
Explain the use of artificial variable in linear programming.
What do you understand by shadow prices? What is the managerial
implication of shadow prices?
Health Centre is a clinic specializing in four types of patient care: dermatology
cosmetic surgery, obstetrics and neurosurgery. A patient in each of these
specialties contributes Rs 4000, 6000, 8000 and 10000, respectively to profits
of the clinic. Past data reveals the following time requirements limitations:
Hours required per patient
Speciality Lab XRay Therapy Surgery Doctonl
Dermatology 5 8 10 8 14 j
Cosmetics 5 2 1 4 10
Obstetrics 3 1 0 6 8
Neurosurgery 2 4 8 16 12
Hours available per week 200 140 110 240 320
The doctors have access to as many patients as they wish. They have limited their
cosmetic and neurosurgery practice to a total of 150 hours a week. Determine the