Abstract
This chapter presents the geometric approach for linear programming. Linear programming has been applied to such diverse areas as economics, engineering, biology, agriculture, business, and the social sciences. The geometric method of solving linear programming problems is quite adequate for problems involving two unknowns. For problems involving three unknowns, a geometric method is applicable but is harder to apply. For most problems involving more than three unknowns, geometric methods are usually not applicable. A corner point in a convex set is any point in the set that is the intersection of two boundary lines.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
