Difference between revisions of "Linear programming"

From Optimization for Chemical Engineering: 4G3
Jump to navigation Jump to search
Line 1: Line 1:
__NOTOC__
__NOTOC__
{{ClassSidebar
{{ClassSidebarYouTube
| date = 07 January to 04 February 2015
| date = 07 January to 04 February 2015
| dates_alt_text =  
| dates_alt_text =  
| vimeoID1 = 116180574
| vimeoID1 = c5d5Sqh5enE
| vimeoID2 = 116577435
| vimeoID2 = E-GlTTLzbSc
| vimeoID3 = 116796213
| vimeoID3 = jUq6QTTAPJc
| vimeoID4 = 117193750
| vimeoID4 = t_U015J0iqQ
| vimeoID5 = 117414659
| vimeoID5 = ZDr5iu9LzuE
| vimeoID6 = 117952974
| vimeoID6 = EUC4dRqZhXw
| vimeoID7 = 118045280
| vimeoID7 = hpuAPO3BTew
| vimeoID8 = 118739369
| vimeoID8 = loWOX4zCpZ0
| vimeoID9 =
| vimeoID9 =
| vimeoID10 =
| vimeoID10 =
Line 80: Line 80:
| align="left" colspan="1"|
| align="left" colspan="1"|
[https://docs.google.com/document/d/1WxIMpERJgZZUbdok_eUAFdMJ_2U2A_jDAVq0sSoJ2ro Handout from class]
[https://docs.google.com/document/d/1WxIMpERJgZZUbdok_eUAFdMJ_2U2A_jDAVq0sSoJ2ro Handout from class]
| [https://drive.google.com/file/d/0B9qiArsxgE8YdWNSZVJ0cnZHREE Video]  
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-01B.mp4 Video]  
|align="left" colspan="1"|
|align="left" colspan="1"|
<!-- An important and useful reference that you should read as self-study described [http://onlinelibrary.wiley.com/doi/10.1002/14356007.o16_o04/full how membranes are made] (requires a McMaster internet connection). -->
|-
|-
| 12 January
| 12 January
Line 93: Line 92:
| align="left" colspan="1"|
| align="left" colspan="1"|
[https://docs.google.com/document/d/1zQkvE0h9S-NRgGJIxD-zVGD6fbsHUSFRFK3hjW-hkRg Handout from class]
[https://docs.google.com/document/d/1zQkvE0h9S-NRgGJIxD-zVGD6fbsHUSFRFK3hjW-hkRg Handout from class]
| [https://drive.google.com/file/d/0B9qiArsxgE8YWEhXUlRrM1dpZ1U/view?usp=sharing Video]  
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-02A.mp4 Video]  
|align="left" colspan="1"|
|align="left" colspan="1"|
We covered topics on page 11, 13, 14 and 17 of the notes by Marlin (see comment above).
We covered topics on page 11, 13, 14 and 17 of the notes by Marlin (see comment above).
Line 104: Line 103:
| align="left" rowspan="2"|
| align="left" rowspan="2"|
[https://docs.google.com/document/d/1NfY58o58LSGGZausUrowQMGdNuftbdCMwDbK-mUF-PQ/ Handout from class]  
[https://docs.google.com/document/d/1NfY58o58LSGGZausUrowQMGdNuftbdCMwDbK-mUF-PQ/ Handout from class]  
| [https://drive.google.com/file/d/0B9qiArsxgE8YTjNqQ3Q0bVgzSGc Video]  
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-02B.mp4 Video]  
|align="left" rowspan="2"|
|align="left" rowspan="2"|
We covered topics on page 21 to 29 of the notes by Marlin, however, I did not focus on the mathematical details; we only consider the geometric viewpoint in 4G3.
We covered topics on page 21 to 29 of the notes by Marlin, however, I did not focus on the mathematical details; we only consider the geometric viewpoint in 4G3.
Line 113: Line 112:
* Running the simplex method to solve LPs
* Running the simplex method to solve LPs
* Interpretation of the optimum solution
* Interpretation of the optimum solution
| [https://drive.google.com/file/d/0B9qiArsxgE8YMUlfa2JyZDNtNlU Video]
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-03A.mp4 Video]
|-
|-
| 21 January
| 21 January
Line 122: Line 121:
| align="left" colspan="1"|
| align="left" colspan="1"|
[https://docs.google.com/document/d/13GjbGCOxqO67pUDfVVQOfzBGvFl6gqZCNIrT54YMFPk Handout from class]
[https://docs.google.com/document/d/13GjbGCOxqO67pUDfVVQOfzBGvFl6gqZCNIrT54YMFPk Handout from class]
| [https://drive.google.com/open?id=0B9qiArsxgE8YS0V3ZkF2ajlEYWc&authuser=0 Video]  
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-03B.mp4 Video]  
|align="left" |
|align="left" |
See page 37 and 38 in Marlin's notes for an alternative visualization of sensitivity analysis.
See page 37 and 38 in Marlin's notes for an alternative visualization of sensitivity analysis.
Line 135: Line 134:
| align="left" colspan="1"|
| align="left" colspan="1"|
[https://docs.google.com/document/d/1o8GdJERF0NvH2EafNbfOSDGIUaV8-pr6roGSb241oXY Handout from class]
[https://docs.google.com/document/d/1o8GdJERF0NvH2EafNbfOSDGIUaV8-pr6roGSb241oXY Handout from class]
| [https://drive.google.com/open?id=0B9qiArsxgE8YMFl6SGVlbjFRYjQ&authuser=0 Video]   
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-04A.mp4 Video]   
|align="left" |
|align="left" |
|-
|-
Line 148: Line 147:
| align="left" colspan="1"|
| align="left" colspan="1"|
[https://docs.google.com/document/d/1EQSzelonUYt0rcyj5s8tOPcQimQvhBKGIKLUgJpURNY/edit Handout from class]
[https://docs.google.com/document/d/1EQSzelonUYt0rcyj5s8tOPcQimQvhBKGIKLUgJpURNY/edit Handout from class]
| [https://drive.google.com/open?id=0B9qiArsxgE8YVU50QkFudFlkNEU&authuser=0 VideoA]  and [https://drive.google.com/open?id=0B9qiArsxgE8YRFRTaUkyVXlsbHM&authuser=0 VideoB]
| [http://learnche.mcmaster.ca/media/2015-4G3-Class-04B.mp4 VideoA]  and [http://learnche.mcmaster.ca/media/2015-4G3-Class-04B-wrap-up.mp4 VideoB]
|align="left" |
|align="left" |
|}
|}

Revision as of 17:02, 3 January 2017

Class date(s): 07 January to 04 February 2015








References

Dr. Marlin has made a great, short e-book on Linear Programming. You will find reading his notes very rewarding, and a great supplement to the class lectures.

Resources

Scroll down, if necessary, to see the resources.

Date Class number Topic Slides/handouts for class Video file References and Notes
07 January 01B
  • Degrees of freedom
  • Terminology related to optimization
  • Introductory linear programming problem

Handout from class

Video
12 January 02A
  • More terminology related to optimization
  • Continue with our introductory LP problem
  • Geometric aspects of the optimum
  • Moving LP problems into standard form

Handout from class

Video

We covered topics on page 11, 13, 14 and 17 of the notes by Marlin (see comment above).

14 January 02B
  • Getting the LP problem into standard form
  • Starting to understand the Simplex method to solve LPs

Handout from class

Video

We covered topics on page 21 to 29 of the notes by Marlin, however, I did not focus on the mathematical details; we only consider the geometric viewpoint in 4G3.

19 January 03A
  • Running the simplex method to solve LPs
  • Interpretation of the optimum solution
Video
21 January 03B
  • Interpretation of general LP models
  • Understand the effects of changes in the model on the optimum solution (i.e. sensitivity analysis)

Handout from class

Video

See page 37 and 38 in Marlin's notes for an alternative visualization of sensitivity analysis.

26 January 04A
  • Understand the effects of changes in the model on the optimum solution (i.e. sensitivity analysis)
    • The effect of \(b_i\) changes on the RHS
    • The effect of \(A\) changes on the LHS
    • The effect of \(c_i\) changes in the objective

Handout from class

Video
28 January and 04 February 04B
  • Recapped some concepts on sensitivity analysis
  • Considered sensitivity analysis where two or more variables were varied
  • Getting a general understanding of LPs
    • Allocation problems
    • Blending problems

Handout from class

VideoA and VideoB


The R-code used to draw the plot in the class handout 2B and 3A.

plot(c(0, 100), c(0, 70), type = "n", xlab = expression(x[1]), ylab = expression(x[2]), asp = 1)
abline(a=1500/10, b=-16/10, lw=7)            # Placement
abline(a=1000/12, b=-10/12, lw=5)            # Solder
abline(a=500/8, b=-4/8, lw=3)                # Inspection
abline(v=0, h=0)
title(expression("Objective: Maximize 10"~x[1]~"+ 15"~x[2]))

text(20, 55, expression("Inspection: 4"~x[1]~"+ 8"~x[2]~"+ "~x[5]~" = 500"), srt=332.5) 
text(35, 57, expression("Solder: 10"~x[1]~"+ 12"~x[2]~"+ "~x[4]~" = 1000"), srt=319.5)
text(65.5, 50, expression("Placement: 16"~x[1]~"+ 10"~x[2]~"+ "~x[3]~" = 1500"), srt=301)
text(2, 30, expression("Non-negativity: "~x[1]>=~"0"), srt=90)
text(45, 2, expression("Non-negativity: "~x[2]>=~"0"), srt=0)

delta=2
text(0+delta, 0+delta, "[0]")
text(0+delta, 62.5-2*delta, "[1]")
text(62.5, 31.25-1.5*delta, "[2]")
text(87-delta, 10.9-1.0*delta, "[3]")
text(93.75-2.1*delta, 0+1.0*delta, "[4]")