Question

In the graphical solution of a linear programming problem to minimize cost, we seek to move...

In the graphical solution of a linear programming problem to minimize cost, we seek to move the example line for the objective function

  1. Away from the origin

  2. Toward the origin

  3. Parallel to the X1 axis

  4. Parallel to the X2 axis

  5. None of the above

Homework Answers

Answer #1

Away from the origin

(To Minimize the objective function, we take the equation of constraints of greater than type (e.g. The comtraint maybe 2x + 3y >=4.

We solve the equations graphically and give the outside area from the points at which the equations of constraints are solved. We find out the objective function such that Z objective function will have a certain mimnum value, that is Z is greater than or equal to some value, thus we seek to move example line for objective function away from origin)

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1...
Solve the following linear programming problem graphically: Minimize cost = 4X1 + 5X2 Subject to: X1 + 2X2 > (or equal to) 80 3X1 + X2 > (or equal to) 75 X1, X2 > 0
If a problem is referred to as a linear programming problem, what must be true? A)...
If a problem is referred to as a linear programming problem, what must be true? A) the objective function must be linear B) both the objective function and the constraints must be linear C) the constraints must be linear D) the decision variables must be linear Three essential elements of a linear programming formulation are the: A) decision variables, feasibility, constraints B) constraints, objective function, non-negativity C) decision variables, objective function, constraints D) objective function, constraints, solution When constraints identify...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2 ≤ 4      5x1+ 3x2 ≤15       x1,x2 ≥ 0 Graph the region that satisfies the constraints. Find the optimal solution and the value of the objective function at the optimal solution.
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region then determine the optimal solution (s) (show your work). Minimize Z = 3x1 + 7x2 Subject to 9x1 + 3x2 ≥ 36 4x1 + 5x2 ≥ 40 x1 – x2 ≤ 0 2x1 ≤ 13 x1, x2 ≥ 0 b. Are any constraints binding? If so, which one (s)?
The following is the mathematical model of a linear programming problem for profit: Maximize subject to...
The following is the mathematical model of a linear programming problem for profit: Maximize subject to Z = 2X1 + 3X2 4X1+9X2 ≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153 X1 , X2 ≥ 0 The constraint lines have been graphed below along with one example profit line (dashed). The decision variable X1 is used as the X axis of the graph. Use this information for questions 19 through 23. A). Which of the following gives...
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on the feasible region described by the...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
The following is the mathematical model of a linear programming problem for profit: Maximize Z =...
The following is the mathematical model of a linear programming problem for profit: Maximize Z = 2X1 + 3X2 subject to: 4X1 + 9X2 ≤ 72 10X1 + 11X2 ≤ 110 17X1 + 9X2 ≤ 153 X1 , X2 ≥ 0 The constraint lines have been graphed below along with one example profit line (dashed). The decision variable X1 is used as the X axis of the graph. Which of the following gives the constraint line that cuts the X2...
The following constraints of a linear programming model have been graphed on the graph paper provided...
The following constraints of a linear programming model have been graphed on the graph paper provided (same constraints found in problem #3) to form a feasible region: 2X    + 6Y     >=    120 10X + 2Y     > =   200 X      +     Y     <=    120 X                     <=    100                  Y    <=      80 X,Y                  >=        0 Using the graphical method, determine the optional solution and the objective function value for the following objective functions. Graph the objective function as a dashed line on...
2. The following linear programming problem has been solved by The Management Scientist. Use the output...
2. The following linear programming problem has been solved by The Management Scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3 S.T. 1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION Objective Function Value = 4700.000 Variable Variable Reduced Cost X1 140.000   0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint   Slack/Surplus Dual Price 1   0.000   1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES Variable   Lower Limit Current Value Upper Limit X1 19.286 25.000 45.000 X2 No Lower Limit 30.000 40.000...