|
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 23rd.
a. Minimization Linear Programming Problems
b. Corner Points Method for Minimization Problems
c. Iso-Profit Line Method for Minimization Problems
d. Constraints Analysis
e. Unbounded Feasible Region
f. Unbounded Linear Programming Problem
g. Multiple Optimal Solutions
h. Infeasible Problem
|
