3.2: Linear Programming - Method of Corners

Finite Math (SJDC M20) v2 · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY 4.0, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    Learning Objectives

    In this chapter, you will learn to:

    1. Solve linear programming problems that maximize the objective function.
    2. Solve linear programming problems that minimize the objective function.

    • 3.2.1: Maximization Applications
      Application problems in business, economics, and social and life sciences often ask us to make decisions on the basis of certain conditions. The conditions or constraints often take the form of inequalities. In this section, we will begin to formulate, analyze, and solve such problems, at a simple level, to understand the many components of such a problem.
    • 3.2.2: Minimization Applications
      Minimization linear programming problems are solved in much the same way as the maximization problems.

    Thumbnail: A pictorial representation of a simple linear program with two variables and six inequalities. The set of feasible solutions is depicted in yellow and forms a polygon, a 2-dimensional polytope. The linear cost function is represented by the red line and the arrow: The red line is a level set of the cost function, and the arrow indicates the direction in which we are optimizing. (CC0; Ylloh via Wikipedia)

    This page titled 3.2: Linear Programming - Method of Corners was last modified on Sat, 06 Jun 2026 03:24:15 GMT and is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by Rupinder Sekhon and Roberta Bloom via source content that was edited to the style and standards of the LibreTexts platform.