File:Linear programming graphical solution.png

Summary

Description
English: Graphical solution to the following LP

Maximize Z=100X1+200X2 (Objective function)
Subject to
X1+X2 ≤ 150 (1)
4X1+2X2 ≤ 440 (2)
X1+4X2 ≤ 480 (3)
X1 ≤ 90 (4)
X1 ≥ 0; X2 ≥ 0 (5)

B(X1=40;X2=110) is the optimal solution.
Date
Source Own work
Author GYassineMrabetTalk
Permission
(Reusing this file)
w:en:Creative Commons
attribution
This file is licensed under the Creative Commons Attribution 3.0 Unported 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.
Category:CC-BY-3.0#Linear%20programming%20graphical%20solution.png

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 3.0 Unported 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.
Category:CC-BY-SA-3.0#Linear%20programming%20graphical%20solution.pngCategory:Self-published work
Category:Linear programming
Category:CC-BY-3.0 Category:CC-BY-SA-3.0 Category:Linear programming Category:Self-published work