Purchase Solution

Finding feasible points for constraints

Not what you're looking for?

Ask Custom Question

Use the constraints given below and determine which of the following points is feasible.
(1) 14x + 6y 42
(2) x - y 3

a. x = 1; y = 5
b. x = 2; y = 2
c. x = 2; y = 8
d. x = 2; y = 4
e. x = 3; y = 0.5

Purchase this Solution
Solution Summary

This posting contains a procedure to find feasible points for given constraints

Purchase this Solution
Free BrainMass Quizzes
Organizational Leadership Quiz

This quiz prepares a person to do well when it comes to studying organizational leadership in their studies.

Learning Lean

This quiz will help you understand the basic concepts of Lean.

Understanding Management

This quiz will help you understand the dimensions of employee diversity as well as how to manage a culturally diverse workforce.

Team Development Strategies

This quiz will assess your knowledge of team-building processes, learning styles, and leadership methods. Team development is essential to creating and maintaining high performing teams.

Accounting: Statement of Cash flows

This quiz tests your knowledge of the components of the statements of cash flows and the methods used to determine cash flows.

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?

  • Linear Programming Sensitivity Analysis

    That is, the set of all points that satisfy all the constraints. Only points in the feasible region can be used.

  • Linear Programming: Largest possible adjacent basic feasible solutions

    51406 Largest possible adjacent basic feasible solutions For a given basic feasible solution in a problem in standard form with no degenerate extreme points, what is the largest possible number of adjacent basic feasible solutions that it can have, as

  • 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.

  • all-integer linear program

    Solve the problem as a linear program ignoring the integer constraints. Show that the optimal solution to the linear program gives fractional values for both x1 and x2. b.

  • Linear Programs and Inequalities

    Next, find the value of the objective function at each of the corner points (i.e., enumerating the corner points).

  • Linear programming MCQs and problems

    A feasible solution satisfies all constraints. b. An optimal solution satisfies all constraints. c. An infeasible solution violates all constraints. d. A feasible solution point does not have to lie on the boundary of the feasible region. 4.

  • Linear programming

    a) An infeasible solution violates all constraints. b) A feasible solution point does not have to lie on the boundary of the feasible solution. c) A feasible solution satisfies all constraints. d) An optimal solution satisfies all constraints.

  • MCQs on LPP

    A feasible solution satisfies all constraints. b. An optimal solution satisfies all constraints. c. An infeasible solution violates all constraints. d. A feasible solution point does not have to lie on the boundary of the feasible region. 4.

View More Related Solutions