Transcription of Math 407 — Linear Optimization 1 Introduction
{{id}} {{{paragraph}}}
Math 407 Linear Optimization1 What is Optimization ?A mathematical Optimization problem is one in which some function is either maximized orminimized relative to a given set of alternatives. The function to be minimized or maximizedis called theobjective functionand the set of alternatives is called the feasible region (orconstraint region). In this course, the feasible region is always taken to be a subset ofRn(realn-dimensional space) and the objective function is a function further restrict the class of Optimization problems that we consider to Linear program-ming problems (or LPs). An LP is an Optimization problem overRnwherein the objectivefunction is a Linear function, that is, the objective has the formc1x1+c2x2+ +cnxnfor someci2Ri=1.
edge either in the direction of the gradient vector for maximization (or in the oppo-site direction of the gradient vector for minimization) to the last point for which the straight-edge intersects the feasible region. The set of points of intersection between the straight-edge and the feasible region is the set of solutions to the LP.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}