Explanation Given Information: Minimize c = x − 3 y subject to the given following constraint 3 x + y ≥ 5 , 2 x − y ≥ 0 , x − 3 y ≤ 0 and x ≥ 0 , y ≥ 0 . Formula used: Draw a rectangle large enough that all the corner points are inside the rectangle. Shade the outside of the rectangle so as to define a new bounded feasible region and locate the new corner points. Obtain the optimal solutions using bounded feasible region. If the optimal solution occur at the one of the corner points, then LP problem has that corner point as optimal solution otherwise it has no optimal solution. Calculation: Consider the first constraint equation, 3 x + y = 5 Isolate the variable y , by subtracting 3 x from both sides, 3 x − 3 x + y = 5 − 3 x y = 5 − 3 x To plot the graph of the function, find the ordered pairs of the equation by substituting different values of x . For x = 0 , substitute 0 for x , y = 5 − 3 ⋅ 0 = 5 − 0 = 5 For x = 1 , substitute 1 for x , y = 5 − 3 ⋅ 1 = 5 − 3 = 2 For x = 2 , substitute 2 for x , y = 5 − 3 ⋅ 2 = 5 − 6 = − 1 Construct a table for the ordered pairs, x 0 1 2 y 5 2 -1 Test the first inequality by ( 0 , 0 ) test coordinates as; 3 x + y ≥ ? 5 3 ⋅ 0 + 0 ≥ ? 5 0 + 0 ≥ ? 5 0 ≥ ? 5 The inequality is not satisfied. If the test point does not satisfy the inequality then the set of solutions is the line plus the entire region on the other side of the line i.e. away from the test coordinate ( 0 , 0 ) . Consider the second constraint equation, 2 x − y = 0 Isolate the variable y , by subtracting 2 x from both sides, 2 x − 2 x − y = 0 − 2 x − y = − 2 x y = 2 x To plot the graph of the function, find the ordered pairs of the equation by substituting different values of x . For x = 0 , substitute 0 for x , y = 2 ⋅ 0 = 0 For x = 1 , substitute 1 for x , y = 2 ⋅ 1 = 2 For x = 2 , substitute 2 for x , y = 2 ⋅ 2 = 4 Construct a table for the ordered pairs, x 0 1 2 y 0 2 4 Test the second inequality by ( 1 , 1 ) test coordinates as; 2 x − y ≥ ? 0 2 ⋅ 1 − 1 ≥ ? 0 2 − 1 ≥ ? 0 1 ≥ ? 0 The inequality is satisfied. If the test point satisfies the inequality then the set of solutions is the line plus the entire region on the same side of the line as the test coordinate ( 1 , 1 ) . Consider the third constraint equation, x − 3 y = 0 Isolate the variable y , by subtracting x from both sides, x − x − 3 y = 0 − x − 3 y = − x y = x 3 To plot the graph of the function, find the ordered pairs of the equation by substituting different values of x

7th Edition

ISBN: 9781337280426

Author: Stefan Waner, Steven Costenoble

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 5.2, Problem 17E

To determine

To calculate: Optimal solution of given linear programming problem to minimize c=x−3y subject to the given following constraints 3x+y≥5,2x−y≥0,x−3y≤0 and x≥0,y≥0.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 5.2, Problem 16E

Chapter 5.2, Problem 18E

Students have asked these similar questions

Determine whether the lines L₁ (t) = (-2,3, −1)t + (0,2,-3) and L2 p(s) = (2, −3, 1)s + (-10, 17, -8) intersect. If they do, find the point of intersection.

Convert the line given by the parametric equations y(t) Enter the symmetric equations in alphabetic order. (x(t) = -4+6t = 3-t (z(t) = 5-7t to symmetric equations.

Find the point at which the line (t) = (4, -5,-4)+t(-2, -1,5) intersects the xy plane.

Chapter 5 Solutions

Finite Mathematics

Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - Prob. 6E Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - In Exercises 1-26, sketch the region that...Ch. 5.1 - Prob. 9E Ch. 5.1 - In Exercises 1-26, sketch the region that...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

Optimal solution of given linear programming problem to minimize c = x − 3 y subject to the given following constraints 3 x + y ≥ 5 , 2 x − y ≥ 0 , x − 3 y ≤ 0 and x ≥ 0 , y ≥ 0 .

Solution Summary: The author calculates the optimal solution of a linear programming problem to minimize c=x-3y subject to the following constraints.

Videos

To calculate: Optimal solution of given linear programming problem to minimize c=x−3y subject to the given following constraints 3x+y≥5,2x−y≥0,x−3y≤0 and x≥0,y≥0.

Want to see the full answer?

Chapter 5 Solutions