Jump to content

File:Cutting plane algorithm.png

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (844 × 699 pixels, file size: 15 KB, MIME type: image/png)

Summary

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 the optimal LP solution (blue).
Date
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.
Author Sdo
Permission
(Reusing this file)
own work
Other versions Image:Cutting_plane_algorithm.jpg

Licensing

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.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

13 August 2006

image/png

7967a4fc0f5d9513098ddb23255a459c30a019ef

15,765 byte

699 pixel

844 pixel

File history

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

Date/TimeThumbnailDimensionsUserComment
current21:24, 13 August 2006Thumbnail for version as of 21: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 use this file (pages on other projects are not listed).

Global file usage

The following other wikis use this file: