3
Advanced Topics in Linear Programming
The dual of a linear programming problem finds a place in this chapter. The economic interpretation of dual variables that can be used by management for planning its resources is also explained in this chapter. If a LPP involving a large number of variables and constraints is solved by this method, it will require a large storage space and time on a computer. Some computational techniques have been developed which require much less computer storage and time than that required by the simplex method. The two important and efficient computational techniques are the revised simplex method or simplex method with multipliers and the bounded variables method. The revised simplex method is dealt with in this chapter. ...
Get Operations Research, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
