Graphical method calculator https://cbom.atozmath.com/CBOM/Simplex.aspx?q=gm&q...

Prikaži stranicu na ovom jeziku: hrvatski Prevedi Isključi za: engleski Opcije ▼

We use cookies to improve your experience on our site and to show you relevant advertising. By browsing this website, you agree to our use of cookies. Learn more Accept

Support us
I want to sell my website www.AtoZmath.com with complete code
Odaberite jezik
Pokreće Prevoditelj

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-Algebra

Home > Operation Research calculators > Graphical method calculator

Algorithm and examples

Method 1. Graphical method
Solve the Linear programming problem using
Graphical method calculator
Type your linear programming problem
MAX Z = 3x1 + 2.5x2
subject to
x1 + 2x2 >= 20
3x1 + 2x2 >= 50
and x1,x2 >= 0

OR
Total Variables : 2 Total Constraints : 2 Generate

Max Z= 3 x1 + 2.5 x2
Subject to constraints
1 x1 + 2 x2 >= 20

3 x1 + 2 x2 >= 50
and x1,x2 >= 0
Mode : Decimal

Print Digit = 4
Find Random New

Solution Help

ReCalculate problem by considering objective function as

MAX Z = 3x1 + 2.5x2+ 0 ReCalculate

Solution will be displayed step by step (In 2 parts)

Solution

Find solution using graphical method

MAX Z = 3x1 + 2.5x2
subject to
x1 + 2x2 >= 20
3x1 + 2x2 >= 50
and x1,x2 >= 0

Solution:
Problem is
MAX Z = 3 x 1 + 2.5 x 2
subject to
x 1 + 2 x 2 ≥ 20
3 x 1 + 2 x 2 ≥ 50
and x 1, x 2 ≥ 0;

Hint to draw constraints

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

Treat it as x 1 + 2x 2 = 20

When x 1 = 0 then x 2 = ?

⇒ (0) + 2x 2 = 20

⇒ 2x 2 = 20

20
⇒ x2 = = 10
2

When x 2 = 0 then x 1 = ?

⇒ x 1 + 2(0) = 20

⇒ x 1 = 20

x 1 0 20

x 2 10 0

Put x 1 = 0, x 2 = 0 (origin) in x 1 + 2x 2 ≥ 20, then 0 + 0 ≥ 20, which is false,

1 of 3 10/28/23, 00:52
Graphical method calculator https://cbom.atozmath.com/CBOM/Simplex.aspx?q=gm&q...

The half plane not containing the origin is the region of the solution set of the inequation x 1 + 2x 2 ≥ 20

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

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

When x 1 = 0 then x 2 = ?

⇒ 3(0) + 2x 2 = 50

⇒ 2x 2 = 50

50
⇒ x2 = = 25
2

When x 2 = 0 then x 1 = ?

⇒ 3x 1 + 2(0) = 50

⇒ 3x 1 = 50

50
⇒ x1 = = 16.67
3

x 1 0 16.67

x 2 25 0

Put x 1 = 0, x 2 = 0 (origin) in 3x 1 + 2x 2 ≥ 50, then 0 + 0 ≥ 50, which is false,

The half plane not containing the origin is the region of the solution set of the inequation 3x 1 + 2x 2 ≥ 50

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 = 3x 1 + 2.5x 2
(x 1,x 2)

2 → 3x 1 + 2x 2 ≥ 50
A(0, 25) 3(0) + 2.5(25) = 62.5
3 → x1 ≥ 0

1 → x 1 + 2x 2 ≥ 20
B(15, 2.5) 3(15) + 2.5(2.5) = 51.25
2 → 3x 1 + 2x 2 ≥ 50

1 → x 1 + 2x 2 ≥ 20
C(20, 0) 3(20) + 2.5(0) = 60
4 → x2 ≥ 0

Problem has an unbounded solution.

Note: In maximization problem, if shaded area is open-ended. This means that the maximization is not possible and the LPP
has no finite solution. Hence the solution of the given problem is unbounded.

2 of 3 10/28/23, 00:52
Graphical method calculator https://cbom.atozmath.com/CBOM/Simplex.aspx?q=gm&q...

Solution provided by AtoZmath.com

Any wrong solution, solution improvement, feedback then Submit Here

Xmin 0 Xmax 22
Ymin 0 Ymax 30
Gridlines X: 2 Gridlines Y: 5
Redraw

Share this solution or page with your friends.

Home What's new College Algebra Games Feedback About us

Copyright © 2023. All rights reserved. Terms, Privacy

NOW
PLAYING

3 of 3 10/28/23, 00:52