Keywords for LP: Introduction and Graphical Methods for Maximization Problems

For this discussion topic, each student is required to have at least 2 postings: One explaining at least one of the following lettered keywords and a second responding to another student’s posting. Please select a lettered keyword that has not been explained by the time you post your response. You can select any keyword to explain once all keywords are explained. Please do not copy the definition of a keyword from the textbook or the lecture notes. Please do not copy another student’s posting. Use your own words to explain the meaning of each keyword. You can also give examples to clarify your definition.

This discussion will close at midnight Sunday, September 16^th.

a. Linear Programming

b. Mathematical Modeling

c. Advantages and Disadvantages of Graphical Methods

d. Feasible Region for a Linear Programming Problem

e. Optimal Solution and Optimal Value

f. Corner or Extreme Points

g. Iso-Profit (Objective Function) Lines

h. Standard Form

i. Slack and Surplus Variables