Operations Research Answers

Questions: 623

Answers by our Experts: 472

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Search & Filtering

Solve the following job sequencing problem by giving an optimal sequence of jobs, and find the



total elapsed time also. Note that M1, M2, M3, M4, M5 and M6 are machines and A, B, C, D



are jobs.



Jobs → A B C D



M1 20 19 13 22



M2 10 8 7 6



M3 9 11 10 5



Machines M4 4 8 7 6



M5 12 10 9 10



M6 27 21 17 14

Solve the following job sequencing problem by giving an optimal sequence of jobs, and find the



total elapsed time also. Note that M1, M2, M3, M4, M5 and M6 are machines and A, B, C, D



are jobs.



Jobs → A B C D



M1 20 19 13 22



M2 10 8 7 6



M3 9 11 10 5



Machines M4 4 8 7 6



M5 12 10 9 10



M6 27 21 17 14

onsider the following problem


Maximize          Z = 6x1+8x2

Subject to: 

                  5x1+2x2 ≤ 20

                  X1+2x2≤ 10

And

                 X1≥ 0, X2≥ 0


a. Construct the dual problem for this primal problem

b. Solve both the primal problem and the dual problem graphically. Identify the CPF solutions and corner-point infeasible solutions for both problems. Calculate the objective function values for all these solutions

c. Use the information obtained in part (b) to construct a table listing the complementary basic solutions for these problems.

d. Work through the simplex method step by step to solve the primal problem. After each iteration (including iteration 0), identify the BF solution for this problem and the complementary basic solution for the dual problem. Also identify the corresponding corner-point solutions.



Consider the following problem

 

Maximize                   Z = 6x1+8x2

Subject to:

                                  5x1+2x2 ≤ 20

                                  X1+2x2≤ 10

And

                                 X1≥ 0, X2≥ 0

Solve the dual of the following linear programming problem using the simplex method. 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑃 = 20𝑥 + 30𝑦 + 45𝑧 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 20𝑥 + 40𝑦 + 30𝑧 ≤ 800 30𝑥 + 20𝑦 + 40𝑧 ≤ 800 20𝑥 + 10𝑦 + 30𝑧 ≤ 1000 𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0


) Solve the dual of the following linear programming problem using the simplex method.

𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑃 = 20𝑥 + 30𝑦 + 45𝑧

𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜

20𝑥 + 40𝑦 + 30𝑧 ≤ 800

30𝑥 + 20𝑦 + 40𝑧 ≤ 800

20𝑥 + 10𝑦 + 30𝑧 ≤ 1000

𝑥 ≥ 0, 𝑦 ≥ 0, 𝑧 ≥ 0


An investor wants to identify how much to invest in two funds, one equity and one debt. Total amount available is Rs. 5, 00, 000. Not more than Rs. 3, 00, 000 should be invested in a single fund. Returns expected are 30% in equity and 8% in debt. Minimum return on total investment should be 15%. Formulate as LPP.


An established company has decided to add a new product to its line. It will buy the product from a manufacturing concern, package it, and sell it to a number of distributors selected on a geographical basis. List of activities involved in the new product introduction and their immediate predecessors are shown in the following table (4 points). Activity Preceding Actives Activity duration (Days) A --- 4 B --- 7 C --- 6 D A, B 5 E A, B 7 F C, D, E 6 G C, D, E 5 a. Draw the project network using the Activity on Arrow (A-O-A) convention. b. Compute float (slack) time of each activity. c. Determine the critical path and calculate the project duration (completion time)
The doctor advises a patient visited him that the patient is weak in his health due to shortage of two vitamins, i.e., vitamin A and vitamin D. He advises him to take at least 40 units of vitamin A and 50 units of Vitamin D every day. He also advises that these vitamins are available in two tonics X and Y. Each unit of tonic X consists of two units of vitamin A and three units of vitamin D

An electronics manufacturing company has three production plants, each of which produces three different models of a particular MP3 player. The daily capacities (in thousands of units) of the three plants are shown in the table. Basic model Gold model Platinum model Plant 1 8 4 8 Plant 2 6 6 3 TUTORIAL LETTER SEMESTER 2/2021 MATHEMATICS FOR ECONOMISTS 1B MFE512S 12 Plant 3 12 4 8 The total demands are 300,000 units of the Basic model, 172,000 units of the Gold model, and 249,500 units of the Platinum model. The daily operating costs are $50,000 for plant 1, $60,000 for plant 2, and $60,000 for plant 3. How many days should each plant be operated in order to fill the total demand while keeping the operating cost at a minimum? What is the minimum cost? Use the method of the dual


LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS