File:Linear programming feasible region farmer example.svg
Appearance
Size of this PNG preview of this SVG file: 512 × 512 pixels. Other resolutions: 240 × 240 pixels | 480 × 480 pixels | 768 × 768 pixels | 1,024 × 1,024 pixels | 2,048 × 2,048 pixels.
Original file (SVG file, nominally 512 × 512 pixels, file size: 6 KB)
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 11:46, 15 August 2024 | 512 × 512 (6 KB) | Cmglee | Work around misaligned-non-uniform-scaled-text rsvg bug T370044 | |
14:15, 5 August 2023 | 512 × 512 (7 KB) | Cmglee | Work around text-anchor rsvg bug | ||
14:50, 20 March 2023 | 512 × 512 (7 KB) | Cmglee | Label feasible region | ||
14:41, 20 March 2023 | 512 × 512 (7 KB) | Cmglee | {{Information |Description=Graphical solution to the farmer example by CMG Lee. After shading regions violating the conditions, the vertex of the unshaded region with the dashed line farthest from the origin gives the optimal combination. |Source={{own}} |Date= |Author= Cmglee |Permission= |other_versions= }} Category:Linear programming problems |
File usage
The following 2 pages use this file:
Global file usage
The following other wikis use this file:
- Usage on es.wikipedia.org