Purchase Solution

Linear programming: graph constraints, find optimal solution

Not what you're looking for?

Ask Custom Question

Solve the following problem graphically.

Max 5X + 6Y
s.t. 17X + 8Y < 136
3X + 4Y < 36
X, Y > 0 and integer

a. Graph the constraints for this problem. 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.

Purchase this Solution
Solution Summary

This response provides instructional advice in graphing constraints and solving for the optimal solution.

Purchase this Solution
Free BrainMass Quizzes
Organizational Behavior (OB)

The organizational behavior (OB) quiz will help you better understand organizational behavior through the lens of managers including workforce diversity.

SWOT

This quiz will test your understanding of the SWOT analysis, including terms, concepts, uses, advantages, and process.

Transformational Leadership

This quiz covers the topic of transformational leadership. Specifically, this quiz covers the theories proposed by James MacGregor Burns and Bernard Bass. Students familiar with transformational leadership should easily be able to answer the questions detailed below.

Writing Business Plans

This quiz will test your understanding of how to write good business plans, the usual components of a good plan, purposes, terms, and writing style tips.

Marketing Research and Forecasting

The following quiz will assess your ability to identify steps in the marketing research process. Understanding this information will provide fundamental knowledge related to marketing research.

View More Free Quizzes
Related BrainMass Solutions

  • integer (linear) programming model problem

    Find the optimal solution for the original model as given. Solve the following integer (linear) programming model problem graphically by manual hand-drawn construction of the graph.

  • Linear Programming

    (b) Find the optimal solution to the linear programming problem. Show your work. The optimal solution can only occur at the one of the four corner points.

  • Slack, Surplus, and Artificial Variables

    They are used to find the initial basic solution of a linear programming problem (Arsham, 1997).

  • Quanitive Methods Analysis

    point to find the solution values at each point plot the model constraints as equations on the graph and indicate the feasible solution area d. none of the above ______ 7.

  • Maxwell Manufacturing Linear Programming Model, Extreme Poin

    To find extreme point, graph these constraints on graph: Four extreme points are (0, 0), (0, 9), (15/2, 0) and (105/17, 90/17). c) What is the optimal solution?

  • MCQs on LPP

    To find the optimal solution to a linear programming problem using the graphical method a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location.

  • Use LP relaxation to solve Mix Integer programming problem

    Graph the constraints for this problem. Indicate on your graph all feasible mixed-integer solutions. b. Find the optimal solution to the LP Relaxation. Round the value of x1 down to find a feasible mixed-integer solutions.

  • Maximization or minimization of a quantity

    To find the optimal solution to a linear programming problem using the graphical method a. find the feasible point that is the farthest away from the origin. b. find the feasible point that is at the highest location.

  • Integer Linear Programming

    Find the optimal integer solution. Hello Please see the word and excel document attached. Thanks Solution contains graph of the constraints, solution of LP relaxation of the problem and optimal integer solution.

View More Related Solutions