Difference between revisions of "Linear programming"
Jump to navigation
Jump to search
Kevin Dunn (talk | contribs) |
Kevin Dunn (talk | contribs) |
||
Line 25: | Line 25: | ||
| video_download_link2_MP4_size = 812 M | | video_download_link2_MP4_size = 812 M | ||
| video_notes2 = | | video_notes2 = | ||
| video_download_link3_MP4 = https:// | | video_download_link3_MP4 = https://drive.google.com/file/d/0B9qiArsxgE8YTjNqQ3Q0bVgzSGc | ||
| video_download_link3_MP4_size = 840 M | | video_download_link3_MP4_size = 840 M | ||
| video_notes3 = | | video_notes3 = | ||
| video_download_link4_MP4 = https:// | | video_download_link4_MP4 = https://drive.google.com/file/d/0B9qiArsxgE8YMUlfa2JyZDNtNlU | ||
| video_download_link4_MP4_size = 820 M | | video_download_link4_MP4_size = 820 M | ||
| video_notes4 = | | video_notes4 = | ||
| video_download_link5_MP4 = https:// | | video_download_link5_MP4 = https://drive.google.com/open?id=0B9qiArsxgE8YS0V3ZkF2ajlEYWc&authuser=0 | ||
| video_download_link5_MP4_size = 807 M | | video_download_link5_MP4_size = 807 M | ||
| video_notes5 = | | video_notes5 = | ||
Line 104: | Line 104: | ||
| 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:// | | [https://drive.google.com/file/d/0B9qiArsxgE8YTjNqQ3Q0bVgzSGc 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 113: | ||
* 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:// | | [https://drive.google.com/file/d/0B9qiArsxgE8YMUlfa2JyZDNtNlU Video] | ||
|- | |- | ||
| 21 January | | 21 January | ||
Line 122: | Line 122: | ||
| 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:// | | [https://drive.google.com/open?id=0B9qiArsxgE8YS0V3ZkF2ajlEYWc&authuser=0 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. |
Revision as of 23:16, 9 April 2015
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 |
|
Video | ||
12 January | 02A |
|
Video |
We covered topics on page 11, 13, 14 and 17 of the notes by Marlin (see comment above). | |
14 January | 02B |
|
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 |
|
Video | ||
21 January | 03B |
|
Video |
See page 37 and 38 in Marlin's notes for an alternative visualization of sensitivity analysis. | |
26 January | 04A |
|
Video | ||
28 January and 04 February | 04B |
|
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]")