Purchase Solution

graph of the constraints

Not what you're looking for?

Ask Custom Question

A set of contraints for the profit formula P=5x+2Y are given.

a) Draw the graph of the constraints and find the vertices of the feasible region.
b) Use the vertices to determine the maximum and minimum profit.

X+Y is Less than or equal to 5; X is more than or equal to 0

X-2Y is less than or equal to 6; Y is more than or equal to 0

Purchase this Solution
Solution Summary

Draw the graph of the constraints and find the vertices of the feasible region. Use the vertices to determine the maximum and minimum profit.

Solution Preview

See the attached files.

The given problem is
Profit P = 5X + 2 Y
Constraints X + Y ≤ 5
X ...

Purchase this Solution
Free BrainMass Quizzes
Exponential Expressions

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

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

Multiplying Complex Numbers

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

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Graphing Constraints: Feasible Region

    Question: Graph the following constraints ( 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?

  • Integer Linear Programming

    Thanks Solution contains graph of the constraints, solution of LP relaxation of the problem and optimal integer solution.

  • Multi-Object Linear Programming

    Determine graphically whether each of the following is an efficient solution: (a) We wish to maximize each of the following three objective functions separately: subject to the constraints The region R of the -plane subject to the

  • integer (linear) programming model problem

    Find the optimal solution for the original model as given. Do both hand-drawn/manual construction of the graph AND computer output. Remark: The constraints of LP model should be >= or <=, so I changed the signs in your model. a.

  • Opportunity Cost & Comparative Advantage-Droids and Hyper-Drives

    The solution provides a detailed analysis of the problem including a graph for a better understanding of the trade-off costs and budget constraints

  • Consumer Economics

    Graph the budget line and determine the market rate of substitution? b. Explain the illustrate the budget set? c. Show in your graph whta happens to the budget constraints if P(x) incereases to $10.00 dollars? d.

  • Binding Constraints

    B and C Constraints A and C (This is my answer from the graph that I did.)

  • Linear Programming

    161547 Linear Programming Constraints 6. Consider the linear programming problem: max 4x − 3y x + y <= 5 6x − 3y <= 12 x, y >= 0 The graph of the constraints is given below with the feasible region shown in grey.

  • Linear Programming: Profit Maximization

    This constraints can be simplified as: To solve this LP problem, we have the following steps. Step1: Change all the inequalities to equations and sketch the graph of all the equations. The graph is show as above.

View More Related Solutions