find the dual of the given linear programming problem 5. Maximizesubject to3x1 + x2 + 4x3z =3x1 + 3x, + X3 < 182x1 + 2x2 + 4xz = 12x1 2 0, x3 2 0.6. Minimizez = 5x1 + 2x2 + 6x3subject to4x1 + 2x, + x3 z 12Зx, + 2х, + 3x, s 6х, 2 0, х, 2 0.

We to convert the given linear programming problem in to dual problem. The solution is explained…

Answered: 5. Maximize z = 3x, + x2 + 4x3 subject…

College Algebra

7th Edition

ISBN:9781305115545

Author:James Stewart, Lothar Redlin, Saleem Watson

Publisher:James Stewart, Lothar Redlin, Saleem Watson

Chapter5: Systems Of Equations And Inequalities

Section: Chapter Questions

Problem 1P

See similar textbooks

Similar questions

Minimize and maximizez=30x+20ySubject to 3x+y≥36x+y≥24x+3y≥30x, y≥0
A rectangular vault is to be constructed on an existing floor at a bank so as to enclose avolume of 485 cubic meters. The cost per square meter of materials is $2,000 for the ceiling,$9,000 for the wall with the door and $3,000 for the other three walls. The minimized costof the vault rounded to the nearest $1,000 dollars is:a. $964,000b. $971,000c. $982,000d. $993,000
Minimize z=12x+13y Subject to: 3/2x-3y>or=6 2x+2y>or=14 X>or=0, y>or=0
Prove that if you minimize the square of the distancefrom the origin to a point (x, y) subject to the constraintg(x, y) = 0, you have minimized the distance from theorigin to (x, y) subject to the same constraint.
Determine the number of slack variables required. Maximize z=15x1+7x2 subject to: 2x1+6x2≤20 15x1+x2 ≤50 4x1 + 15x2 ≤ 125 with x1≥0, x2≥0.
2. Maximise 1170x1 + 1110x2Subject to: 9x1 + 5x2 ≥ 5007x1 + 9x2 ≥ 3005x1 + 3x2 ≤ 15007x1 + 9x2 ≤ 19002x1 + 4x2 ≤ 1000x1, x2 ≥ 0-Find graphically the feasible region and the optimal solution.
Find the values of x, y, and z that maximize xyz subject to the constraint 192−x−8y−16z=0. x=_________?
A company can sell all it produces of a given output for$2/unit. The output is produced by combining two inputs. Ifq1 units of input 1 and q2 units of input 2 are used, then the company can produce q1/31q2/32 units of the output. If it costs$1 to purchase a unit of input 1 and $1.50 to purchase a unitof input 2, then how can the company maximize its profit?
Find the multiple solutions.Maximize z = 45x1 + 30x2, subject to 2x1 + 9x2 ≤ 144 2x1 + 3x2 ≤ 60 3x1 + 2x2 ≤ 75 x1 ≥ 0, x2 ≥ 0 z = at ( , 0), ( , ), and on the line segment between.
A piece of wire of length 60 is cut, and the resulting two pieces are formed to make a circle and square. What should the wire be cut to (a) maximize and (b) minimize the combined area of the circle and the square?
Suppose the feasible region has four corners at these points (0,0), (8,0), (0,12), and (4,8). If the profit formula is P = $2x + $4y, what is the maximum profit possible?
To minimize costs on the production line, an industrial engineer at a fiber-optic manufacturing firm is considering two robots. Robot X would have a $82,000 first cost, a $30,000 annual maintenance and operation (M&O) cost, and $50,000, $42,000, and $35,000 salvage prices after 1, 2, and 3 years, respectively. Robot Y will have a first cost of $97,000, a yearly M&O cost of $27,000, and after 1, 2, and 3 years, respectively, salvage prices of $60,000, $51,000, and $42,000. If a 2-year study period is specified at an interest rate of 15 percent per year and replacement after 1 year is not an option, what robot should be selected?

SEE MORE QUESTIONS

Recommended textbooks for you

College Algebra

Algebra

ISBN:

9781305115545

Author:

James Stewart, Lothar Redlin, Saleem Watson

Publisher:

Cengage Learning

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

College Algebra

Algebra

ISBN:

9781305115545

Author:

James Stewart, Lothar Redlin, Saleem Watson

Publisher:

Cengage Learning

Linear Algebra: A Modern Introduction

Algebra

ISBN:

9781285463247

Author:

David Poole

Publisher:

Cengage Learning

SEE MORE TEXTBOOKS

5. Maximize z = 3x, + x2 + 4x3 subject to 3x, + 3x2 + xz < 18 2x1 + 2x2 + 4xz = 12 %3D X1 2 0, x3 2 0. 6. Minimize z = 5x, + 2x2 + 6x3 subject to 4x, + 2x, + X3 z 12 3x, + 2x2 + 3x356 X1 2 0, x2 2 0.