Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3, Problem 16RP
Explanation of Solution
Modified formulation:
- The old formulation is as follows,
- The above function subject to the following constraints,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
An Uni has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship at most 5 times.
The head of the Uni ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?
The first line of input contains two integers, n and k. The next line contains n integers: y1, y2, ..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-thperson participated in the ACM ICPC Regional .
Write a python program that prints how many teams can be formed according to the above problem statement.
Sample Input 1
52 04510
Sample Input 2
64 012345
Sample Input 3
65 000000
Sample Output
1 1
Sample Output
2 0
Sample Output
3 2
As a teaching administrator of the department, your responsibility is to schedule the
classes for a particular classroom. Suppose there are n classes, each class i is
represented by its start time and finishing time [Si, fi], and we say that two classes i
and j are non-conflicting if they do not overlap in time (i.e., sizfj or szfi). You want to
schedule as many classes for the classroom as possible, but the scheduled classes
should be non-conflicting. Develop an algorithm so that you can select the maximum
number of classes for the classroom. (We are expecting either pseudocode or
language description of your algorithm)
Give a complete problem formulation for each of the following problems. Choose a formulation that is precise enough to be implemented.
d. A container ship is in port, loaded high with containers. There 13 rows of containers, each 13 containers wide and 5 containers tall. You control a crane that can move to any location above the ship, pick up the container under it, and move it onto the dock. You want the ship unloaded.
Chapter 3 Solutions
Operations Research : Applications and Algorithms
Ch. 3.1 - Prob. 1PCh. 3.1 - Prob. 2PCh. 3.1 - Prob. 3PCh. 3.1 - Prob. 4PCh. 3.1 - Prob. 5PCh. 3.2 - Prob. 1PCh. 3.2 - Prob. 2PCh. 3.2 - Prob. 3PCh. 3.2 - Prob. 4PCh. 3.2 - Prob. 5P
Ch. 3.2 - Prob. 6PCh. 3.3 - Prob. 1PCh. 3.3 - Prob. 2PCh. 3.3 - Prob. 3PCh. 3.3 - Prob. 4PCh. 3.3 - Prob. 5PCh. 3.3 - Prob. 6PCh. 3.3 - Prob. 7PCh. 3.3 - Prob. 8PCh. 3.3 - Prob. 9PCh. 3.3 - Prob. 10PCh. 3.4 - Prob. 1PCh. 3.4 - Prob. 2PCh. 3.4 - Prob. 3PCh. 3.4 - Prob. 4PCh. 3.5 - Prob. 1PCh. 3.5 - Prob. 2PCh. 3.5 - Prob. 3PCh. 3.5 - Prob. 4PCh. 3.5 - Prob. 5PCh. 3.5 - Prob. 6PCh. 3.5 - Prob. 7PCh. 3.6 - Prob. 1PCh. 3.6 - Prob. 2PCh. 3.6 - Prob. 3PCh. 3.6 - Prob. 4PCh. 3.6 - Prob. 5PCh. 3.7 - Prob. 1PCh. 3.8 - Prob. 1PCh. 3.8 - Prob. 2PCh. 3.8 - Prob. 3PCh. 3.8 - Prob. 4PCh. 3.8 - Prob. 5PCh. 3.8 - Prob. 6PCh. 3.8 - Prob. 7PCh. 3.8 - Prob. 8PCh. 3.8 - Prob. 9PCh. 3.8 - Prob. 10PCh. 3.8 - Prob. 11PCh. 3.8 - Prob. 12PCh. 3.8 - Prob. 13PCh. 3.8 - Prob. 14PCh. 3.9 - Prob. 1PCh. 3.9 - Prob. 2PCh. 3.9 - Prob. 3PCh. 3.9 - Prob. 4PCh. 3.9 - Prob. 5PCh. 3.9 - Prob. 6PCh. 3.9 - Prob. 7PCh. 3.9 - Prob. 8PCh. 3.9 - Prob. 9PCh. 3.9 - Prob. 10PCh. 3.9 - Prob. 11PCh. 3.9 - Prob. 12PCh. 3.9 - Prob. 13PCh. 3.9 - Prob. 14PCh. 3.10 - Prob. 1PCh. 3.10 - Prob. 2PCh. 3.10 - Prob. 3PCh. 3.10 - Prob. 4PCh. 3.10 - Prob. 5PCh. 3.10 - Prob. 6PCh. 3.10 - Prob. 7PCh. 3.10 - Prob. 8PCh. 3.10 - Prob. 9PCh. 3.11 - Prob. 1PCh. 3.11 - Show that Finco’s objective function may also be...Ch. 3.11 - Prob. 3PCh. 3.11 - Prob. 4PCh. 3.11 - Prob. 7PCh. 3.11 - Prob. 8PCh. 3.11 - Prob. 9PCh. 3.12 - Prob. 2PCh. 3.12 - Prob. 3PCh. 3.12 - Prob. 4PCh. 3 - Prob. 1RPCh. 3 - Prob. 2RPCh. 3 - Prob. 3RPCh. 3 - Prob. 4RPCh. 3 - Prob. 5RPCh. 3 - Prob. 6RPCh. 3 - Prob. 7RPCh. 3 - Prob. 8RPCh. 3 - Prob. 9RPCh. 3 - Prob. 10RPCh. 3 - Prob. 11RPCh. 3 - Prob. 12RPCh. 3 - Prob. 13RPCh. 3 - Prob. 14RPCh. 3 - Prob. 15RPCh. 3 - Prob. 16RPCh. 3 - Prob. 17RPCh. 3 - Prob. 18RPCh. 3 - Prob. 19RPCh. 3 - Prob. 20RPCh. 3 - Prob. 21RPCh. 3 - Prob. 22RPCh. 3 - Prob. 23RPCh. 3 - Prob. 24RPCh. 3 - Prob. 25RPCh. 3 - Prob. 26RPCh. 3 - Prob. 27RPCh. 3 - Prob. 28RPCh. 3 - Prob. 29RPCh. 3 - Prob. 30RPCh. 3 - Graphically find all solutions to the following...Ch. 3 - Prob. 32RPCh. 3 - Prob. 33RPCh. 3 - Prob. 34RPCh. 3 - Prob. 35RPCh. 3 - Prob. 36RPCh. 3 - Prob. 37RPCh. 3 - Prob. 38RPCh. 3 - Prob. 39RPCh. 3 - Prob. 40RPCh. 3 - Prob. 41RPCh. 3 - Prob. 42RPCh. 3 - Prob. 43RPCh. 3 - Prob. 44RPCh. 3 - Prob. 45RPCh. 3 - Prob. 46RPCh. 3 - Prob. 47RPCh. 3 - Prob. 48RPCh. 3 - Prob. 49RPCh. 3 - Prob. 50RPCh. 3 - Prob. 51RPCh. 3 - Prob. 52RPCh. 3 - Prob. 53RPCh. 3 - Prob. 54RPCh. 3 - Prob. 56RPCh. 3 - Prob. 57RPCh. 3 - Prob. 58RPCh. 3 - Prob. 59RPCh. 3 - Prob. 60RPCh. 3 - Prob. 61RPCh. 3 - Prob. 62RPCh. 3 - Prob. 63RP
Knowledge Booster
Similar questions
- Consider the following case study: "Springfield University offers a number of courses. A course contains a number of units. Students enrol and elect a set of units every semester. Students are allowed to enrol in a maximum of 5 units in any given seme ster. They can only be enrolled into a single course at any given point in time. However, over a student's lifetime, they may undertake a number of different courses. Each unit has a set fee that is set at the start of the semester. This fee is to be paid up-front in full by the students once enrolled. Some units have pre-requisite unit requirements. Some units have co-requisite unit requirements. To be enrolled in some courses, you must have completed a certain course (e.g. to enrol into a Postgraduate course, you must have an Undergraduate degree)." Noun (bold)/verb (underline) analysis on the case study is marked for you to identify candidate classes, attributes, operations. Now, draw the domain model for the above case study.arrow_forwardI want to answer him a question : a b c d e farrow_forwardThe Night Owls Society is arranging a conference. To minimize costs, they want to schedule as many sessions as possible in the main ballroom. Since night owls go to bed late and wake up late, they want sessions to begin as late as possible and don't care how late they run. Each session has a fixed start time and a fixed end time, though sessions may overlap. For example, the sessions may be as follows. (In a realistic version of this problem, there may be many more sessions.) Session Name Basket weaving Floral arrangements Cake decoration Cookie baking Pasta making Start time End time 10:30 AM 11:45 AM 10:45 AM 12:30 PM 12:15 AM 2:00 PM 12:45 PM 3:00 PM 2:15 PM 4:30 PM Table decoration 3:30 PM 5:45 PM a. Define what it means for this problem to have optimal substructure. b. Show that this problem does have optimal substructure. c. What algorithmic strategy can one use to solve a problem with optimal substructure? (Do not write out the algorithm.) d. What does it mean for a problem to…arrow_forward
- 3. A technician takes X hours to visit the stores in a couple of streets in one shift, and when he finishes his tour, another technician revisits the same stores again, needing other X hours to finish the second shift, and so on. For example, if the first technician started his shift at 1:00pm, he finishes it at 7:00pm and the second technician starts his shift at 7:00pm and finishes it at 1:00am, and so on. The supervisors used to make a quick meeting with all technicians twice a day at 1:00 am and 1:00 pm, so they need to finish their tours exactly 1:00. Identify the mathematical notation for the number of shifts should be made by the technicians in order to achieve this, write the name of this mathematical value, and find it for two tours, one with X=7 and another with X = 11 .arrow_forwardExercise 1 Santa is worried about his employee relations, since christmas preparations have led to a lot of overtime. To make sure all the elves are happy, he wants to recruit some of them as complaint officers, with weekly meetings to report any complaints or worries to him. His worker elves W are pretty busy already, so Santa wants to task no more than k elves with this additional workload. Still, Santa wants to make sure that for as many elves e e W as possible, at least one of his friends (whose identities he knows) is a complaint officer. 1. Give an intuitive greedy algorithm that outputs k elves that will serve as compliant officers. 2. Prove that for large numbers of k the algorithm approximates a solution with ratio no more than (1 – !).arrow_forward4. Consider the Railway Reservation System. There are a number of trains and each train stops in one or more stations. Each train has a predetermined number of seats available in each of classes (First class, First AC, Second AC, Third AC, Sleeper and so on). The fare between two stations is determined by the class of travel and the distance. Passenger can enquire about the availability of seats between any two stations and for any class. The Railway Reservation System should be able to handle the queries and perform the necessary reservation/ cancellation operations. Draw a class diagram for the case study.arrow_forward
- Jin Mori is like any other student who loves sleeping. Jin Taejin, his grandfather, imposes a waking schedule that Jin Mori must follow to avoid tardiness at his school. The schedule stated that on weekdays, Mori must be awake at "7:00" and at "10:00" at weekends. Taejin added an exemption for their school vacation. If it is their school vacation, the schedule is "10:00" for weekdays and "off" for weekends. If Jin will not follow the schedule, he is not allowed to practice his favorite martial art, taekwondo. Your job is to create a program that will serve as the alarm clock for Jin Mori. Expected Output: Test Case 1: Vacation: False Day: Monday Alarm Time: 7:00 Awake: Yes Be ready for your practice Mori! Test Case 2: (input) (input) (auto generated) (input) Vacation: False Day: Saturday Alarm Time: 10:00 Awake: No (input) (input) (auto generated) (input) You are not allowed to practice your taekwondo!arrow_forwardIn a private university, students can enrol for at least 1 to a maximum of 5 subjects in a semester. Subjects that are to be offered in that particular semester will be assigned to a class. One class should have at least 5 students and up to a maximum of 40 students. Multiple classes for a subject can be created if the students number enrolled for the subject is large. A subject might not be offered on that semester depending on the needs. A lecturer can be assigned to zero and up to a maximum of 4 classes on that particular semester. Draw the class diagram to represent the above scenario. Each entity should have at least 1 attribute as its identity. Provide the relevant associations between these entities and include the multiplicities.arrow_forwardb. A listening test is one of the components in the MyEnglish competency test that can be taken a maximum of 3 times only by each student. Students will have to redo the test if the marks obtained is less than 70. The final mark obtained by students is calculated based on the average marks from all the listening tests taken. Based on the above scenario, create a flow chart to solve the problem.arrow_forward
- The Nobel peace prize is awarded to persons who excel in various fields of endeavor. Currently only a handful of panel members determine and choose people who qualify for a particular award based on nomination from a wide range of disciplines’. This process of selecting the winners for the various prices have been criticized as being biased especially from the side of the panel members. The committee of experts at a general council meeting decided to automate the selection process. On a trial bases, you have been engaged to develop a system that will automatically select a nominee as the winner of the award in two categories (peace and science). Your program should have the following methodsalities. a) You are to define a class named NobelAward. Your class must have two methodss, one of the methodss should be named AwardCategory, and the other methods should be named AwardWinner. Your AwardCategory must have a string argument and return the string when called.…arrow_forwardThe Nobel peace prize is awarded to persons who excel in various fields of endeavor. Currently only a handful of panel members determine and choose people who qualify for a particular award based on nomination from a wide range of disciplines’. This process of selecting the winners for the various prices have been criticized as being biased especially from the side of the panel members. The committee of experts at a general council meeting decided to automate the selection process. On a trial bases, you have been engaged to develop a system that will automatically select a nominee as the winner of the award in two categories (peace and science). Your program should have the following methodsalities.a) You are to define a class named NobelAward. Your class must have two methodss, one of the methodss should be named AwardCategory, and the other methods should be named AwardWinner. Your AwardCategory must have a string argument and return the string when called. Your AwardWinner methods…arrow_forwardA materials engineer wants to study the effects of two different processes for sintering copper (aprocess by which copper powder coalesces into a solid but porous copper) on two different typesof copper powders. From each type of copper powder, she randomly selects two samples andthen randomly assigns one of the two sintering processes to each sample by the flip of a coin.The response of interest measured is the porosity of the resulting copper. Explain what type ofstudy this is and why.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole