Linear Programming  The Graphical Method
Solve the linear programming programming by graphing and then determining which vertex minimizes the objective function G=4x+3y .
{5x+15y≥15
{5x+5y≥35
{x≥0
{y≥0
x =
y =
What is the minimum value? G=
asked by
siri

This web site is very useful:
http://www.zweigmedia.com/RealWorld/LPGrapher/lpg.htmlposted by Steve
Respond to this Question
Similar Questions

ST
linear programming programming by graphing and then determining which vertex minimizes the objective function G=4x+3y . {5x+15y≥15 {5x+5y≥35 {x≥0 {y≥0 x = y = What is the minimum value? G= 
Tod
Solve the linear programming programing by graphing and then determining which vertex minimizes the objective function C=3x+5y. {x+y≥40 {2x+3y≥60 {x≥0 {y≥0 x = y = What is the minimum value? C= 
linear programming
Minimize z = 3x + 6y subject to: 4x + y ≥ 20 x + y ≤ 20 x + y ≥ 10 x ≥ 0 y ≥ 0 Graph the feasibility region. Identify all applicable corner points of the feasibility region. Find the point(s) (x,y) 
Linear Programming
Tab 1: Linear Program: 50 points Consider the Linear Program: Max 2A + 3B s.t. 1A + 2B <= 6 5A + 3B <= 15 A, B >= 0 Use the Solver function of MS Excel to determine the optimal solution for this problem. What is the value 
HELP A.S.A.P. PLEASE: linear programmingmaths
A company makes tennis and squash rackets. Each tennis racket requires two units of aluminum and one unit of nylon. Each squash racket requires 1.8 units of aluminum and 0.8 units of nylon. The company has 1000 units of aluminum 
Mathlinear programming
Which of the following mathematical relationships could be found in a linear programming model? Choose YES if the relationship could be, and NO if it could not. A. YES B. NO 1. B2A + 7B = 45 2. 4A  B ¡Ü 10 3. A + \ 2B ¡Ý 22 
PLEASE HELP... ALGEBRA.... LINEAR PROGRAMMING
HELP ME WITH THESE 2 PROBLEMS PLEASE..... 1. Objective Quantity: C= 5x+4y Constraints: x < 2 x > 4 y > 1 y < 6 All of the signs have lines under them. 2. Objective Quantity: C= 6x + 2y Constraints: x > 0 x < 5 
linear programming problem
Consider the linear programming problem: Maximize P=60x+50y. x+y≤80 5x+10y≤560 50x+20y≤1600 x≥0 y≥0 Use the simplex method to solve the problem. Use s, t, and u as your slack variables for the first, second, and third 
Math
graphing method to solve linear programming problem. z=8x+12y 40x+80y=560 6x+8y=72 x=0y=0 Is there a short cut to find the mmaximum without using the graph? 
algebra 2
by graphing the system of constraints find the values of x and y that minimizes the objective function x+2y>8 x>2 y>0 >=greater than or equal to my answer was 0,10 am i right?