Purchase Solution

graphing the feasible region

Not what you're looking for?

Ask Custom Question

4. Determine whether the following linear programming problem is infeasible, unbounded, or has multiple optimal solutions. Draw a graph and explain your conclusion.

Maximize 20x + 5y
Subject to:
2x + y > 15
x + y < 5

Purchase this Solution
Solution Summary

Graphing the feasible region is modeled.

Solution Preview

You start with graphing the feasible region.
To do that, we graph the lines 2x+y=15 and x+y=5 that will be the boundaries of our region.
The easiest way to graph a line is to find its x- and y-intercepts and if they are two distinct ...

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Graphing Constraints: Feasible Region

    277616 Graphing Constraints: Feasible Region Question: Graph the following costraints (use graph for yourself) 1) 3x1 + 3x2 <= 300 2) 6x1 + 3x2 <= 480 3) 3x1 + 3x2 <= 480 x1 & x2 >= 0 a) Do we have Feasible Region?

  • Graphing feasible regions of inequalities.

    for example Graph the feasible region of each inequality. -2 < x < 2 y > 1 x - y > 0 Shaded areas are the feasible regions. Please see the attached file for the full solution. Thanks for using BrainMass.

  • minimum production cost

    We determine the feasible region (the set of all possible values of x and y satisfying the conditions above) by graphing the lines 600x + 240y = 2520, 240x + 120y = 1080 and finding their intersections, that is, the vertices of the feasible polygon

  • Feasible regions

    5544 Graphing feasible regions of inequalities Having difficulty with graphing feasible regions of inequalities Please see attachments This explains how to graph feasible regions of inequalities

  • Algebra - Linear Operators

    Formulate a linear programming problem to maximize taxpayer satisfaction subject to the constraints on discretionary spending. 2. Graph the constraints as when finding the feasible region 3.

  • Feasible region

    2500 Feasible Region Created What is a feasible region and how do I create one?

  • Compound inequality

    So, its graph is the blue region not including the line y-x=5 This provides an example of graphing a compound inequality.

  • Consider the following linear program:

    What are the extreme points of the feasible region? c. Find the optimal solution using the graphical solution procedure. Please see the attached file. The expert determines the feasible region for a linear program.

  • Linear programming: graph constraints, find optimal solution

    Indicate all feasible solutions. b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer solution. Is this solution optimal? c. Find the optimal solution. Please find the solution in the attached file.

View More Related Solutions