Hire us Support us Select Language

I want to sell my website www.AtoZmath.com with complete code

Powered by Translate

Try our new - Enter problem or search problem

Home What's new College Algebra Games Feedback About us
Algebra Matrix & Vector Numerical Methods Statistical Methods Operation Research Word Problems Calculus Geometry Pre-Algeb

Home > Operation Research calculators > Graphical method calculator

** check different types of Graphical method examples

Algorithm and examples
Method 5. Graphical method
Solve the Linear programming problem using
Graphical method calculator
Type your linear programming problem
MIN Z = 1.5x1 + 2x2
subject to
2x1 + 2x2 >= 10
2x1 + x2 >= 7
3/4x1 + 2x2 >= 8
2x1 + 3x2 >= 8

OR
Total Variables : 2 Total Constraints : 4 Generate

Z = 1.5 x1 + 2 x2
Subject to constraints
2 x1 + 2 x2 10
2 x1 + 1 x2 >= 7
3/4 x1 + 2 x2 >= 8
2 x1 + 3 x2 >= 8
and x1,x2 >= 0
Mode : Decimal
Find Random New

Solution Help

Solution

Find solution using graphical method

MIN Z = 1.5x1 + 2x2
subject to
2x1 + 2x2 >= 10
2x1 + x2 >= 7
3/4x1 + 2x2 >= 8
2x1 + 3x2 >= 8
and x1,x2 >= 0

Solution:
Problem is
MIN Z x = 1.5 x 1 + 2 x 2
subject to
2 x 1 + 2 x 2 ≥ 10
2 x1 + x2 ≥ 7
0.75 x 1 + 2 x 2 ≥ 8
2 x1 + 3 x2 ≥ 8
and x 1, x 2 ≥ 0;

Hint to draw constraints

1. To draw constraint 2x 1 + 2x 2 ≥ 10 → (1)

Treat it as 2x 1 + 2x 2 = 10

When x 1 = 0 then x 2 = ?

⇒ 2(0) + 2x 2 = 10

⇒ 2x 2 = 10

10
⇒ x2 = =5
2

When x 2 = 0 then x 1 = ?

⇒ 2x 1 + 2(0) = 10

⇒ 2x 1 = 10
Privacy - Terms
 10
⇒ x1 = =5
2

x1 0 5

x2 5 0

2. To draw constraint 2x 1 + x 2 ≥ 7 → (2)

Treat it as 2x 1 + x 2 = 7

When x 1 = 0 then x 2 = ?

⇒ 2(0) + x 2 = 7

⇒ x2 = 7

When x 2 = 0 then x 1 = ?

⇒ 2x 1 + (0) = 7

⇒ 2x 1 = 7

7
⇒ x1 = = 3.5
2

x 1 0 3.5

x2 7 0

3. To draw constraint 0.75x 1 + 2x 2 ≥ 8 → (3)

Treat it as 0.75x 1 + 2x 2 = 8

When x 1 = 0 then x 2 = ?

⇒ 0.75(0) + 2x 2 = 8

⇒ 2x 2 = 8

8
⇒ x2 = =4
2

When x 2 = 0 then x 1 = ?

⇒ 0.75x 1 + 2(0) = 8

⇒ 0.75x 1 = 8

8
⇒ x1 = = 10.67
0.75

x 1 0 10.67

x2 4 0

4. To draw constraint 2x 1 + 3x 2 ≥ 8 → (4)

Treat it as 2x 1 + 3x 2 = 8

When x 1 = 0 then x 2 = ?

⇒ 2(0) + 3x 2 = 8

⇒ 3x 2 = 8

8
⇒ x2 = = 2.67
3

When x 2 = 0 then x 1 = ?

⇒ 2x 1 + 3(0) = 8

⇒ 2x 1 = 8

8
⇒ x1 = =4
2

x1 0 4
x 2 2.67 0

Privacy - Terms
 The value of the objective function at each of these extreme points is as follows:
Extreme Point
Objective function value
Coordinates Lines through Extreme Point Z = 1.5x 1 + 2x 2
(x 1,x 2)

2 → 2x 1 + x 2 ≥ 7
A(0, 7) 1.5(0) + 2(7) = 14
5 → x1 ≥ 0

2 → 2x 1 + x 2 ≥ 7
B(1.85, 3.31) 1.5(1.85) + 2(3.31) = 9.38
3 → 0.75x 1 + 2x 2 ≥ 8

3 → 0.75x 1 + 2x 2 ≥ 8
C(10.67, 0) 1.5(10.67) + 2(0) = 16
6 → x2 ≥ 0

The miniimum value of the objective function Z = 9.38 occurs at the extreme point (1.85, 3.31).

Hence, the optimal solution to the given LP problem is : x 1 = 1.85, x 2 = 3.31 and min Z = 9.38.

Solution provided by AtoZmath.com

Any wrong solution, solution improvement, feedback then Submit Here

Want to know about AtoZmath.com and me

Xmin 0 Xmax 11.66666

Ymin 0 Ymax 8
Gridlines X: 1 Gridlines Y: 1
Redraw

Home What's new College Algebra Games Feedback About us

Copyright © 2020. All rights reserved. Terms, Privacy

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Privacy - Terms