Question: 15. Consider the problem Maximize Z = X1 - 2x 2 + 3x 3 subject to X1 + X2 + X3 - 7 X1 -

15. Consider the problem Maximize Z = X1 - 2x 2 + 3x 3 subject to X1 + X2 + X3 - 7 X1 - X2 + X3 5 X1 , X2 , X3 2 0 a) Using the M technique, determine the starting objective function after substitution of artificial variables. Set up the initial tableau, but do not perform any additional iteration. b) Solve the problem completely by using the Two-Phase Technique

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!

Consider the following nonlinear programming problem. Maximize Z = x1 (1 x2) x3, Subject to x1 x2 + x3 1 and x1 0, x2 0, x3 0. Use dynamic programming to solve this problem.

Consider the problem Maximize z = 2x1 + 4x2 + 4x3 - 3x4 subject to x1 + x2 + x3 = 4 x1 + 4x2 + x4 = 8 x1, x2, x3, x4 0 Solve the problem with x3 and x4 as the starting basic variables and without...

Consider the problem Maximize z = 2x1 + 4x2 + 4x3 - 3x4 Subject to X1 + x2 + x3 = 4 X1 + 4x2 + x4 = 8 X1, x2, x3, x4 0 The problem shows that x3 and x4 can play the role of slacks for the two...

24. Consider the problem: z = x+5x2 Z +5x 2 + 3x 3 x + 2x 2 + x 3 Maximize subject to 2x - x2 = 4 1 X1, X2, X3 0 = = 3 Solve the problem by using x 3 and R for a starting basic solution, where R is...

Solve the following problem using x3 and x4 as starting basic feasible variables. As in Problem 3-39, do not use any artificial variables. Minimize z = 3x1 + 2x2 + 3x3 subject to x1 + 4x2 + x3 14...

Consider the following linear programming problem: Maximize 40 X1 + 30 X2 + 60X3 Subject to: X1 + X2 + X3 90 12 X1 + 8 X2 + 10 X3 1500 X1 = 20 X3 100 X1, X2, X3 0 How many slack, surplus, and...

Consider the problem Maximize z = x1 + 5x2 + 3x3 Subject to X1 + 2x2 + x3 = 3 2x1 - x2 = 4 X1, x2, x3 0

Consider the problem Maximize z = x1 + x2 subject to 2x1 + x2 6 x1 + 2x2 6 x1 + x2 0 (a) Show that the optimal basic solution includes both x1 and x2 and that the feasibility ranges for the two...

Finite Introduce slack variables as necessary and write the initial simplex tableau for the problem. Maximize z = x1 + 2x;;_ subject to: x1 + x2 5 20 3x1 + 2x2 5 40 2x1 + 3x2 5 60 x1 2 0. x2 > 0

3. [30 points] Consider the following integer nonlinear programming problem. Maximize Z = 32x1 - 2x} + 30x2 + 20xz subject to 3x + 7x2 + 5x3 = 20 and X1, X2, Xz are nonnegative integers. Use dynamic...

In most multi-programmed systems, user programs access memory through virtual addresses, while the operating system uses raw physical addresses to access memory.What are the implications of this...

Milwaukee is a famous name in industrial quality power tools. Its products are renowned for their rugged design and reliability. Most of its products are sold through wholesalers (industrial...

A museum's lobbying nontaxable amount is $ 6 0 0 , 0 0 0 . ( 1 ) Its grass roots nontaxable amount is ? p . 2 5 - 7 ( 2 ) its lobbying expenditures ceiling is ?

A company is in the art of making waist beads. It requires 0.02 Kilograms of colored beads and the company produces and sells 800,000 units of waist beads annually.The cost to place a single order is...