6/25/2021

B.Tech - Odd Sem : End Semester Exam

Academic Year:2020-2021
19CS2104 - Mathematical Programming-1
Set No: 2
Time: Max.Marks: 100
CO
S.NO Answer All Questions Choice Options Marks CO
BTL
A transport company has two types of trucks, Type A and Type B. Type A has refrigerated capacity of 20 m3 and a non-
refrigerated capacity of 40 m3 while Type B has refrigerated capacity of 30 m3 and nonrefrigerated capacity of 30 m3. A
choice
1. grocer needs to hire trucks for the transport of 3,000 m3 of refrigerated stock and 4 000 m3 of non-refrigerated stock. The 10Marks CO1 3
Q-2
cost per kilometer of a Type A is $30 and $40 for Type B. Formulate the problem using mathematical modeling of LPP and
define the objective function. How many trucks of each type should the grocer rent to achieve the minimum total cost?
A human resources office is operating to put in force an increase in beginning salaries for brand new administrative
secretaries and faculty at a community university. An administrative secretary starts off evolved at $28,000 and new faculty
2. receives $40,000. The university would like to determine the percentage growth to allocate to every group, for the reason 10Marks CO1 3
that the university can be hiring 8 secretaries and 7 faculties in the upcoming academic year. The college has at most $5,000
to put toward raises. What should the percentage increase be for every group? Solve LPP graphically?
The Southern states Ring enterprise designs and sell two types of rings: the brass and the aluminum. They can produce upto
24 rings each day the usage of upto 60 total man-hours of labor in line with day. It takes 3 man-hours to make one brass ring choice
3. 15Marks CO1 3
and man-hours to make one aluminum ring. How many each form of ring need to be made daily to maximize the company’s Q-4
profit, if the earnings on a brass ring are $40 and on an aluminum ring is $35? Solve LPP graphically using python?
Solve the following L.P.P. by simplex method. Maximize z = 2x1 + 5x2 subject to x1 + 2x2 ≤ 8 x1 ≤ 4 x2 ≤ 3 x2 ≥ 0, x1 is
4. 15Marks CO1 3
unrestricted in sign .
choice
5. Explain how dual simplex method is different from simplex method. What are steps involved in dual-simplex method. 10Marks CO2 3
Q-6
Solve the following problem using two-phase simplex method. Maximize z = 2x1 + 3x2 + x3 subject to − 3x1 + 2x2 + 3x3 =
6. 10Marks CO2 3
8 −3x1 + 4x2 + 2x3 = 7 x1, x2, x3 ≥ 0.
A business enterprise manufactures 4 variations of the equal product and within the final a part of the manufacturing system
there are assembly, polishing and packing operations. For every version the time required for those operations is shown
below (in minutes) as is the profit in keeping with unit sold. The table is given below.Given the current state of the labor
pressure the business enterprise estimate that, every year, they have 100000 minutes of assembly time, 50000 minutes of
sharpening time and 60000 minutes of packing time available. Suppose now that the corporation is loose to decide how
plenty time to commit to every of the three operations (assembly, sprucing and packing) within the overall allowable time of
210000 (= 100000 + 50000 + 60000) minutes. Formulate the problem using sensitivity analysis

choice
7. 15Marks CO2 3
Q-8

Find solution using dual-simplex method Minimize : C=21x1 + 50x22x1 + 5x2 >=12Subject To: 3x1 +7x2 >=17 X1,x2 >=0
8. 15Marks CO2 3
and implement using python.
The National Association of Securities Dealers Automated Quotation Systems (NASDAQ) is a network system in which
quotation information in over-the-counter operations is collected. Users of the system can receive, in a matter of seconds,
buy and sell prices and the exact bid and ask price of each market maker that deals in a particular security. There are 1700
terminals in 1000 locations in almost 400 cities. The central processing center is in Delhi, Conn., with concentration
facilities in Mumbai, Bangalore, Chennai, and Hyderabad. On this particular day, the market is quiet, so there are only a few
terminals being used. The information they have has to be sent to one of the main processing facilities. The following table
gives terminals (supply centers), processing facilities (demand centers), and the time that it takes to transfer a message.
Solve, using the North West Corner method to find an initial feasible solution
choice
9. 10Marks CO3 3
Q-10

10. 10 10Marks CO3 3

1/3
6/25/2021

11

choice
11. 15Marks CO3 3
Q-12

On a particular day during the tourist season a rent-a-car company must supply cars to four destinations according to the
following schedule:

12. 15Marks CO3 3

13. As the leader of an oil-exploration drilling venture, you must determine the least-cost selection of 5 out of 10 possible sites. choice 10Marks CO4 3

2/3
6/25/2021
Label the sites S1, S2, . . . , S10, and the exploration costs associated with each as C1,C2, . . . ,C10. Regional development Q-14
restrictions are such that: i) Evaluating sites S1 and S7 will prevent you from exploring site S8. ii) Evaluating site S3 or S4
prevents you from assessing site S5. iii) Of the group S5, S6, S7, S8, only two sites may be assessed. Formulate an integer
program to determine the minimum-cost exploration scheme that satisfies these restrictions
14. Explain cutting plane method with an example. 10Marks CO4 3
Three different items are to be routed through three machines. Each item must be processed first on machine 1, then on
machine 2, and finally on machine 3. The sequence of items may differ for each machine. Assume that the times tij required
to perform the work on item i by machine j are known and are integers. Our objective is to minimize the total time necessary
choice
15. to process all the items. a) Formulate the problem as an integer programming problem. [Hint. Let xi j be the starting time of 15Marks CO4 3
Q-16
processing item i on machine j. Your model must prevent two items from occupying the same machine at the same time;
also, an item may not start processing on machine (j + 1) unless it has completed processing on machine j.] b) Suppose we
want the items to be processed in the same sequence on each machine. Change the formulationinpart(a)accordingly
Using Gomory method to find the optimum integer solution to the following𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒𝑧=𝑥1+2𝑥2𝑆𝑢𝑏𝑗𝑒𝑐𝑡𝑡𝑜 2𝑥2≤7𝑥1+𝑥2
16. 15Marks CO4 3
≤72𝑥1≤11𝑥1,𝑥2≥0 𝑎𝑟𝑒𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠
[object HTMLDivElement]

3/3