File:Cutting plane algorithm2.png

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search

Cutting_plane_algorithm2.png(468 × 418 pixels, file size: 7 KB, MIME type: image/png)

Captions

Captions

Add a one-line explanation of what this file represents

Summary[edit]

Description Illustrates a cutting plane algorithm to solve an integer linear program. The green cutting plane separates the blue LP optimum from the red polytope of feasible integer solutions. In the next iteration, the LP will yield the green point as LP optimum.
Date
Source own work, created using xfig and fig2dev.
Author Sdo

Licensing[edit]

I, the copyright holder of this work, hereby publish it under the following license:
w:en:Creative Commons
attribution share alike
This file is licensed under the Creative Commons Attribution-Share Alike 2.5 Generic license.
You are free:
  • to share – to copy, distribute and transmit the work
  • to remix – to adapt the work
Under the following conditions:
  • attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.

File history

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

Date/TimeThumbnailDimensionsUserComment
current19:56, 21 August 2006Thumbnail for version as of 19:56, 21 August 2006468 × 418 (7 KB)Sdo (talk | contribs)Removed the objective function from the image.
00:13, 21 August 2006Thumbnail for version as of 00:13, 21 August 2006468 × 418 (7 KB)Sdo (talk | contribs)Added the next solution of the LP relaxation (green point).
00:04, 21 August 2006Thumbnail for version as of 00:04, 21 August 2006468 × 418 (7 KB)Sdo (talk | contribs){{Information |Description=Illustrates a cutting plane algorithm to solve an integer linear program. The green cutting plane separates the blue LP optimum from the red polytope of feasible integer solutions. In the next iteration, the LP will yield the gr

There are no pages that use this file.