Subject: Solve the following linear programming problem.Maximize: z = 3x + 7ysubject to:7x + 3y ≤ 219x + y ≤ 21x ≥ 0, y 20The maximum value isThe maximum occurs at the point(Type an ordered pair. If the maximum occurs at more than oneor a fraction.)

The LP formulation is shown below, The decision variables are X and YObjective function: MAX…

Answered: The maximum value is The maximum occurs…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 73P

See similar textbooks

Similar questions

Suppose we are solving a maximization problem andthe variable xr is about to leave the basis.a What is the coefficient of xr in the current row 0?b Show that after the current pivot is performed, thecoefficient of xr in row 0 cannot be less than zero.c Explain why a variable that has left the basis on agiven pivot cannot re-enter the basis on the next pivot.
Let A = {0, 1, 2, 3} and define a relation R on A as follows: R = {(0, 0), (0, 2), (0, 3), (2, 2), (2, 0), (1, 1), (2, 1), (3, 3)}. (a) Draw the directed graph of R. (b) Is R reflexive? Explain. (c) Is R symmetric? Explain. (d) Is R transitive? Explain
The constraint 5x 1 − 2x 2 ≤ 0 passes through the point (20, 50). True False
Consider the following LP problem developed at Zafar Malik's Carbondale, Illinois, optical scanning firm: Maximize Z= 1X1+1X2 Subject to: 2X1+1X2≤72 (C1) 1X1+2X2≤72 (C2) X1,X2≥0
Consider the points (0, 0), (1, 1), and (2, 3). Formulatean NLP whose solution will yield the circle of smallestradius enclosing these three points. Use LINGO to solvethe NLP.
Use the simplex method to maximize the given function. Assume all variables are nonnegative. Maximize f = 2x + 9y subject to the following. 2x + 5y ≤ 50 x + 5y ≤ 45 x + y ≤ 14 (x,y)= f=
Consider the problem of calculating the median m of the following numbers: 4,5,9. (a) Write down the linear program that you could solve, to find the median m. Then put this LP in the form: min c^T x s.t. Ax ≥ b, x ≥ 0, where x is your list of variables. (b) Now write down the dual of the problem above. Call the list of dual variables y. (Hint: there are 6 components of y.)
Consider the following LP:Maximize z = 16x1 + 15x2subject to40x1 + 31x2 <=124-x1 + x2<= 1x1<=3x1, x2 >= 0(a) Solve the problem by the simplex method, where the entering variable is thenonbasic variable with the most negative z-row coefficient.
Consider a school district with I neighborhoods, J schools, and G grades at each school. Each school j has a capacity of C jg for grade g. In each neighborhood i , the student population of grade g is S ig. Finally, the distance of school j from neighborhood i is dij . Formulate a linear programming problem whose objective is to assign all students to schools, while minimizing the total distance traveled by all students. (You may ignore the fact that numbers of students must be integer).
Consider the following linear programming model: maximize Z = 3x1 + 2x2 subject to : x1 +x2 ≤ 1 x1 + x2 ≥ 2 x1,x2 ≥ 0 a) Write this model in a standard (augmented) form. (i.e. Introduce slack/surplus, artificial etc.)b) Constract the initial simplex tableau and carry on your calculations to solve this model using the simplex method. Interpret your result.
Consider the following LP problem: Min 6X+ 27Y Subject to : 2 X + 9Y => 25, and X + Y <= 75. Pick a suitable statement for this problem: a. X=37.5, Y=37.5 is the only optimal solution. b. Optimal Obj. function value is 75 c. X = 0, Y = 0 is the only optimal solution. d. Optimal Obj. function value is 0
Find the indicated maximum or minimum value of the objective function in the linear programming problem. Minimize g = 10x + 6y subject to the following. x + 2y ≥ 10 2x + y ≥ 11 x + y ≥ 9 x ≥ 0, y ≥ 0

SEE MORE QUESTIONS

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS

The maximum value is The maximum occurs at the point