Question: Consider the following problem: Maximize z = 2x1 + 2x2 + 4x3 Subject to 2x1 + x2 + x3 2 3x1 + 4x2 +

Consider the following problem:
Maximize z = 2x1 + 2x2 + 4x3
Subject to
2x1 + x2 + x3 ≤ 2
3x1 + 4x2 + 2x3 ≥ 8
X1, x2, x3 ≥ 0
(a) Show that Phase I will terminate with an artificial basic variable at zero level (you may use TORA for convenience).
(b) Remove the zero artificial variable prior to the start of Phase II, then carry out
Phase II iterations.

Step by Step Solution

★★★★★

3.48 Rating (164 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Manimize 242 g t4N3 2 Subyect to 2n4 Mz t ng 8 Now the standand Gorom of egm ... View full answer

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 Computer Engineering Questions!

Consider the following problem presented by Tversky and Kahneman (1983): Linda is 31 years old, single, outspoken, and very bright. She majored in philosophy. As a student, she was deeply concerned...

Consider the following problem description: Employees receive their biweekly paychecks. They are paid their hourly rates for each hour worked; however, if they worked more than 40 hours per week,...

Consider the following problem with three decision alternatives and three states of nature with the following payoff table representing profits: States of Nature S1 S2 S3 Decisions d1 4 4 -2 d2 0 3...

Dual simplex with Artificial constraints. Consider the following problem: Maximize z = 2x1 - x2 + x3 Subject to 2x1 + 3x2 - 5x3 4 - x1 + 9x2 - x3 3 4x1 + 6x2 + 3x3 8 X1, x2, x3 0

Consider the following problem. Maximize Z = 2x1 + 5x2 + 3x3, subject to x1 - 2x2 + x3 >= 20 2x1 + 4x2 + x3 = 50 and x1>=0, x2>=0, x3>=0 Using the two-phase method to solve the problem.

Consider the following problem: Maximize z = 3x1 + 2x2 + 3x3 Subject to 2x1 + x2 + x3 = 2 X1 + 3x2 + x3 = 6 3x1+ 4x2 + 2x3 = 8 X1, x2, x3 0

Consider the following problem: Maximize Z= 3x 1 + 2x 2 Subject to: 2X 1 + X 2 2 3X 1 + 4X 2 12 X 1 , X 2 0 Required : Show graphically that the problem has no feasible extreme points. What can one...

Consider the following problem: Maximize Z = 3x1 + 2x2 + 4x3 + x4, Subject to x1 {1, 3}, x2 {1, 2}, x3 {2, 3}, x4 {1, 2, 3, 4}, all these variables must have different values, x1 + x2 + x3 + x4 ...

Consider the following LP: Maximize z = 2x1 + 3x2 + 5x3 Subject to - 6x1 + 7x2 - 9x3 4 X1 + x2 + 4x3 = 10 X1, x3 0 X2 unrestricted

Consider the following LP: Maximize z = 2x1 + 4x2 + 4x3 - 3x4 Subject to X1 + x2 + x3 = 4 X1 + 4x2 + x4 = 8 X1, x2, x3, x4 0

Do the following. 1. Develop a function that: accepts an list of real numbers (float data type) calculates the sample standard deviation of the list of numbers returns the standard deviation 2....

Dean Parmalee (A-12) wished to know if the year-end grades assigned to Wright State University Medical School students are predictive of their second-year board scores. The following table shows, for...

Find the derivative of the function. y = ln fifth square root 8 3 x

What is the most recent Canadian IPO? Go to ipo.investcom.com and search under the Date of Filing link. What is the company? What exchange trades the stock? What was the IPO price? Is the company...

Nitrogen, N 2 , reacts with oxygen, O 2 , to form nitrogen monoxide, NO. (a) Write the equation of the process. (b) The bond energies in N 2 , O 2 , and NO are respectively 942, 494, and 631 kJ/mol....

What are the advantages of parental control over when and to whom a child marries?

In the summer of 2007, the housing market and the mortgage market were both in decline. Housing prices in most U.S. cities began to decline in mid-2006. With prices falling and the inventory of...

Using the results from Problem 8.1 forecast the birth rate of a country with the characteristics given in Problem 7.9 (see page 254) (point estimate only). Problem 7.9 From your results for the birth...

socw week 2 discussion 1 suicidal and homicidal ideation and provide a strategy to master the effective use of terminology

Consider the LP model Maximize z = 3x1 + 2x1 + 3x3 Subject to 2x1 + x2 + x3 2 3x1 + 4x2 + 2x3 8 X1, x2, x3 0

Modify the LDLt Factorization Algorithm as suggested in the text so that it can be used to solve linear systems. Use the modified algorithm to solve the following linear systems. a. 2x1 x2 = 3, x1 +...

Solution Spaces of Homogenous Linear Algebraic Systems Solve the linear systems given in Problems 1-3 and determine their solution spaces. 1. x1 - x2 + 4x4 + 2x5 - x6 = 0 2x1 - 2x2 + x3 + 2x4 + 4x5 -...

Consider the following set of constraints: X1 + X2 + x3 = 7 2x1 - 5x2 + x3 10 X1, x2, x3 0 Solve the problem for each of the following objective functions: (a) Maximize z = 2X1 + 3X2 - 5X3. (b)...

Consider the following problem. Maximize Z = 2x1 + x2 4x3 + 3x4, Subject to and x2 0, x3 0, x4 0 (no nonnegativity constraint for x1). (a) Reformulate this problem to fit our standard form for a...

Consider the following problem: Maximize Z = 4x1 x12 + 10x2 x22, subject to x12 + 4x22 16 and x1 0, x2 0. (a) Is this a convex programming problem? Answer yes or no, and then justify your...