Image:Cutting plane algorithm.png

From Wikipedia, the free encyclopedia

Wikimedia Commons logo This is a file from the Wikimedia Commons. The description on its description page there is shown below.
Commons is a freely licensed media file repository. You can help.

[edit] Summary

Description

Polytopes of all feasible integer points and of the LP relaxation to the integer linear program max \{ y
Source

Self-made using xfig and fig2dev (see http://www.xfig.org/) under Linux. The .fig-files can be obtained from me upon e-mail request.
Date

August 13, 2006
Author

Sdo
Permission
(Reusing this image)

own work
Other versions Image:Cutting_plane_algorithm.jpg

[edit] Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons License
Creative Commons Attribution iconCreative Commons Share Alike icon		 This file is licensed under the Creative Commons Attribution ShareAlike 2.5 License. In short: you are free to share and make derivative works of the file under the conditions that you appropriately attribute it, and that you distribute it only under a license identical to this one. Official license

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current21:24, 13 August 2006844×699 (15 KB)Sdo ({{Information |Description=Polytopes of all feasible integer points and of the LP relaxation to the integer linear program max \{ y | -x+y <= 1; 3x + 2y <= 12; 2x + 3y <= 12; x,y \in Z_+ \}. The green line is the cutting plane x + 2y <= 6 which cuts off t)
No pages on the English Wikipedia link to this file. (Pages on other projects are not counted.)