Transcription of Linear Programming I: Maximization - Sam Baker
{{id}} {{{paragraph}}}
Example: air traffic controller
Linear Programming I: Maximization - Sam Baker
Linear Programming I 1 Linear Programming I: Maximization 2009 Samuel L. BakerAssignment 10 is on the last problems that Linear Programming can the elements of a Linear Programming problem -- what you need to calculate a the principles that the computer uses to solve a Linear Programming , based on those principles:a. Why some problems have no feasible Why non-linearity requires much fancier able to solve small Linear Programming problems Programming introLinear Programming is constrained optimization, where the constraints and the objective function are alllinear. It is called " Programming " because the goal of the calculations help you choose a "program" ofaction. Classic applications: 1. Manufacturing -- product choiceSeveral alternative outputs with different input requirementsScarce inputsMaximize profit 2.
Translating the word s of Example 1 into equations (wh ich is not a trivial task), we have this: The objective function is Profit = 3x + 4y x is the number of desks y is the number of t ables Constraints: assembling 2.5x + y # 20 buffi ng 3x + 3y # 30 crat ing x + 2y # 16 non -neg ativity x $ 0 y $ 0 The total assembling time, for example, is the
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: