2003 | OriginalPaper | Chapter
Special LFP Problems
Author : Erik B. Bajalinov
Published in: Linear-Fractional Programming Theory, Methods, Applications and Software
Publisher: Springer US
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this chapter, we discuss the following special classes of linear-fractional programming problems: transportation problems, assignment problems, and transshipment problems. While each of these problems can be solved by the simplex method, there are specialized algorithms for each type of problems that are much more efficient than the simplex algorithm.