Question: Minimise subject to Z = 2x1 + x2 x1 + x2 6 |x1x 2 x1 0, 0. (a) Is the problem an LP problem

Minimise subject to Z = 2x1 + x2 x1 + x2 6

Minimise subject to Z = 2x1 + x2 x1 + x2 6 |x1x 2 x1 0, 0. (a) Is the problem an LP problem in its current form? Explain your answer. (b) Sketch the feasible region. (c) Convert the optimization problem into a standard LP problem. Then, solve the problem using simplex method (algebraically). [Hint: x b is equivalent to -b x b.] 2

Step by Step Solution

★★★★★

3.47 Rating (154 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

Solution Consider the following linear program Max Subject to x1 x x1 x at 11 is 7 4x1 2x1 ... 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 Mathematics Questions!

Determine the value of each of the following binomial co-efficients a. b. c. d. 10

Determine the value of each of the following summations (a) (b) (c) (d) where n is an odd positive integer (e) 202 + 1) 2n k (-1).

Determine the value of each of the following using the appropriate formula. 3! (9 - 3)! (14 12)! P. P. 9!

Use the KKT conditions to determine whether (x1, x2, x3) (1, 1, 1) can be optimal for the following problem: Minimize Z 2x1 x2 3 x3 2 , subject to x1 2 2x2 2 x3 2 4 and x1 0, x2 0, x3 0.

3. BIG-M METHOD Solve the following minimization problem using Simplex Method. Find the values of decision variables, \( x_{1} \) and \( x_{2} \), and the objective function, \( z \). \[ \begin{array}

Kondi and Sons makes 2 types of furniture x1 and x2. The selling price for x1 is 6K per unit while x2 sells for 4K per unit. Two machines are used in the production process, the cutting machine and...

4. Solve the following LP model by using the graphic and simplex methods? Maximize z:2x1+x2 Subject to: 5 * 1 + x * 2

5. Solve the following linear programming problem using simplex method: Maximise Subject to Z=8x-4x2 4x +5x 20 -x+3x2-23 x0, x unrestricted in sign.

3. Solve the following problem using simplex method: Maximise Z=21x1 + 15x2 Subject to the constraints -x1-2x2-6, 4x1 + 3x2 12, x1,x20

A channel as shown below is used to convey 19.3 m^3/s of flow at a depth of 5.0 m. Given that flow kinematic viscosity is 1.004 x 10^-6 m^2/s. Find the state of flow of :- i) Froude number ii)...

Suppose that X satisfies the Bolzano-Weierstrass Property and that A and B are compact subsets of X. Prove that if A B = and if dist (A, B) := inf{p(x, y) : x A and y B}, then dist (A, B) > 0....

REVIEW!! I f F ( x ) = 8 x 6 t * e ( 3 - t 2 ) d t , what i s F ' ( 0 . 5 ) ? Round your answer t o TWO decimal places. Answer

A packing crate of mass 40 kg must be moved to the left along the floor without tipping. Knowing that the coefficient of static friction between the crate and the floor is 0.35, determine (a) The...

A collar B of mass m is attached to the spring AB and can move along the rod shown. The constant of the spring is 1.5kN/m and the spring is unscratched when θ = 0. Knowing that the coefficient...

Austin Corporation prepares monthly cash budgets. Here are relevant data from operating budgets for 2012.. All sales and purchases are on account. Budgeted collections and disbursement data are given...

If the wheelbarrow and its contents have a mass of M and center of mass at G, determine the magnitude of the resultant force which the man must exert on each of the two handles in order to hold the...

The mobile crane has weight W1 and center of gravity at G1; the boom has weight W2 and center of gravity at G2. Determine the smallest angle of tilt of the boom, without causing the crane to...

Let p > 2 be a prime. Show that there are exactly p1 2 quadratic residues modulo p

of 7 3. Automatic Zoom (a) Solve the following linear program graphically using an iso-cost/iso-profit line. The vertices (corners) of the feasible region should be clearly labelled A,B,C etc....

Solve the problem given in Example 3.3 by using the two-phase method. The problem is: Minimise Subject to Z = 40x + 24x2 20x+50x2 4,800 80x +50x227,200 X1, X20 Total cost Phosphate requirement...

38. Solve graphically: Minimise Subject to Z = 12x + 3x2 4x+6x2224,000 x1+x2 5,000 8x+2x2 16,000

Solve graphically the following linear programming problem: Minimise Subject to Z = 3x + 5x2 -3x + 4x2 12; 2x + 3x 12; 2x - X2 -2; x4; x2 2, and X1, X20

The solution procedure for the linear programming problems that have the objective function of the minimisation type, is similar to the one for the maximisation problems, except for some differences....

Problem 8 please 102 CHAPTER 1 . FUNCTIONS OF SEVERAL VARIABLES SECTION 1.9 EXERCISES Review Questions 25-34. Applications of Lagrange multipliers Use Lagrange multipli- 1. Explain why, at a point...