short solution Consider the transportation problem having the cost and requirement tablebelow.DESTINΑΤIN1234SUPPLYSOURCE17645023DEMAND 30210535 20 25433043830A.Obtain the initial basic feasible solution using Northwest-Corner, Least-Cost and VAM and determine the value of z.

Using the North-West Corner method D1 D2 D3 D4 Supply S1 9 7 6 4 50 S2 2 4 3 10 30…

Answered: Consider the transportation problem…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter7: Nonlinear Optimization Models

Section: Chapter Questions

Problem 46P

See similar textbooks

Similar questions

In a 3 x 3 transportation problem, let xij be the amount shipped from source i to destination j and let cij be the corresponding transportation cost per unit. The amounts of supply at sources 1, 2, and 3 are 15, 30, and 85 units, respectively, and the demands at destinations 1, 2, and 3 are 20, 30, and 80 units, respectively. Assume that the starting northwest-corner solution is optimal and that the associated values of the multipliers are given us u1 = -2, u2 = 3, u3 = 5, v1 = 2, v2 = 5, and v3 = 10. a) Find the associated optimal cost. b) Determine the smallest value of cij for each nonbasic variable that will maintain the optimality of the northwest-corner solution.
A person starting in Columbus must visit Great Falls, Odessa, and Brownsville, and then return home to Columbus in one car trip. The road mileage between the cities is shown. Columbus Great Falls Odessa Brownsville Columbus --- 102 79 56 Great Falls 102 --- 47 69 Odessa 79 47 --- 72 Brownsville 56 69 72 --- a)Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each b) Find the weight (distance) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (distance) of the circuit.
Consider the transporatio table below: (a) Use the Northwest-Corner Method, the Least-Cost Method and the VAM to get the starting feasible solution. (b) Find the optimal solution by considering the smalles value of the oibjective function computed in (a).
Consider the following linear programming problem: Min Z = 50x1 + 60x2 s.t. 6x1 + 5x2 >= 30 8x1+4x2 >= 32 x1,x2 >=0. What is the Z in the optimal point of this problem? a. 200 b. 250 c. 300 d. 350 e. none of the abov
We have 60 meters of fence and want to fence a triangular shaped area. Please formulate an NLP (do not try to solve) that will enable us to maximize the fenced area (Hint: The area of a triangle with sides of length a, b, and c is ( s (s – a) (s – b) (s – c))1/2, where s is half the parameter of the triangle).
Only Construct Linear Programming Model for the following Problemb; An individual wishes to invest $9000 over the next year in two typar of inventrent linvestment A yinlds 5% and invertment � yields 8%. Market retearch rocotnenends an allocs tion of at least 25% in A and at most 30% in �. Motsover, investment in A should be at least ball the invertmeut in �. How should the fund be allocated to the two imetrinents?
The following table shows the cost to ship goods from Factory 1,2,3 to Warehouse A,B,C: We will designate "F" as the variable for Factory. The constraint that represents the quantity supplied by Factory 1 should be written as: A)F1A+F1B+F1C=500 B)4F1A+6F1B+8F1C<=500 C)F1A+F1B+F1C<=500 D)F1A+F1B+F1C>=500 E)F1A+F2A+F3<=200
You are given the tableau shown in Table 74 for amaximization problem. Give conditions on the unknowns a1, a2, a3, b, and c that make the following statements true: a The current solution is optimal. b The current solution is optimal, and there are alternativeoptimal solutions. c The LP is unbounded (in this part, assume that b0).
A decision problem has the following three constraints: 70X + 6Y <= 420; 24X + 3Y= 72; and 11X - Y <= 14 . The objective function is Min 17X + 38Y . The objective function value is : a. 338 b. 676 c. unbounded d. infeasible e. 0
The Rainwater Brewery produces beer, which it sells to distributors in barrels. The brewery incurs a monthly fixed cost of $12,000, and the variable cost per barrel is $17. The brewery has developed the following profit function and demand constraint: maximize Z = vp - +12,000 - 17v subject to v = 1,800 - 15p Solve this nonlinear programming model for the optimal price (p).
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
Solve the following linear programming problem graphically: Maximize Z=3X+5Y Subject to: 4X+4Y ≤48 C1 1X+2Y ≤20 C2 Y ≥2 C3 X, Y ≥0 Part 2 1) Using the line drawing tool, plot constraint C1 by picking two endpoints for the line. 2) Using the point drawing tool, plot the corner points which define the feasible region. The optimal solution is X= ____ and Y= _______ ( round your responses to whole numbers) Maximum Profit is $ _____ ( round your responses to whole numbers)

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

Consider the transportation problem having the cost and requirement table below. DESTINATION 3 2 4 SUPPLY SOURCE 1 2 2 3 4 DEMAND 30 7 4 3 4 8 3 5 35 20 25 50 30 30 10 A.Obtain the initial basic feasible solution using Northwest-Corner, Least- Cost and VAM and determine the value of z.