Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
expand_more
expand_more
format_list_bulleted
Question
Chapter 3, Problem 36RP
a.
Program Plan Intro
Linear program:
Let,
The, the LPP becomes,
Maximize,
Subject to the constraints,
And
This is the required linear programming problem.
Explanation of Solution
b.
Change to the LP:
Given, there must be at least 5 layouts in each type.
We have,
Then the constraint,
Then the LPP becomes,
Maximize,
Subject to the constraints,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
State the method to be used to find the quantity coordinates when two constraints do not cross at an axis ?
Problem 5. An Electricity board charges the following rates mentioned in the table for the use of
electricity. All users are charged Taka 50 as a meter charge for every month. If any user wants
to change/replace his meter, he will be charged taka 2000. The monthly bill will be generated
based on
● Customer Category
● Consumed Units
● Phase
● For Category 3 and 5 along with other parameters, you need to also consider flat
rate, peak time, and off-peak time. Take input from the user, how many units were
consumed during flat rate, peak, or off-peak time.
● Meter Charge
Write a program to read the name of the user, Customer Category, Phase, number of
units consumed and print out the monthly bill.
Note that
● Phase, flat rate, peak time and off-peak time will be appeared based on the customer
category.
● The monthly bill will be calculated following the number of Days in a month
(a) Suppose there are seven finals to be scheduled. Suppose that the following pairs of courses have common students: 1 and 2, 1 and 3, 2 and 3, 2 and 4, 2 and 5, 2 and 7, 3 and 4, 3 and 6, 3 and 7, 4 and 5, 4 and 6, 5 and 6, 5 and 7, and 6 and 7. How the final exams can be scheduled so that no student has two exams at the same time?
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
- 4. Describe the requirements that need to be satisfied to solve the critical section problem. Give a solution to the critical section problem where there are 2 processes.arrow_forwardSolve the following attachmentarrow_forwardA club has eight members. Three are to be chosen to go as a group to a nationalmeeting.(a) How many distinct groups of three can be chosen?(b) If the club contains four men and four women, how many distinct groups of four containtwo men and one woman?arrow_forward
- identify the following problem components: (a) decision variables; (b) parameters; (c) the objective function in words; and (d) constraints in words. Structures. A singly reinforced rectangular concrete beam must carry a known imposed moment and shear. The span length is also known, and the deflection of the beam must not exceed a certain value. The width and depth of the beam are to be determined, as is the area of steel to be placed in the bottom of the beam. The cost of concrete per-cubic-yard and the cost of steel per-pound is known, as is the compressive strength of the concrete and yield strength of the steel. The designer wants to design the least-cost beam. The code for such beams states that a certain minimum amount of steel, as a percent of the tot al effective cross sectional area, must be present in order to avoid excessive cracking on the bottom of the beam due to temperature fluctuations. The code also gives a limit on the maximum amount of steel, again expressed as a…arrow_forwardQuestion: State the constraints of the problem.arrow_forward2. A safe has 5 locks v, w, y and z; all of which must be unlocked for the safe to open. The keys to the locks are distributed among five executives in the following manner.Mr. A has keys for locks v and x. Mr. B has keys for locks v and y. Mr. C has keys for locks w and y. Mr. D has keys for locks x and z. Mr. E has keys for locks v and z.a) Determine the minimal number of executives required to open the safe.b) Find all the combinations of executives that can open the safe; write and expression f(A, B, C, D, E) which specifies when the safe can be opened as a function of what executives are present.c) Who is the essential executive?arrow_forward
- Which of the following is true regarding the requirements for the solutions to critical-section problem?A) mutual exclusion implies progressB) progress implies bounded waitingC) bounded waiting implies progressD) all of the choices are incorrectarrow_forwardQuestion 2: Wine making club problem: Consider a wine-making club with 8 members and a warehouse of supplies. For a member to make wine, they need to use: 2 Jugs, 1 yeast lock, sweetened fruit juice and wine-making yeast. The initial mixing process requires a mixing station, the fermentation process which requires 4 weeks to produce wine once all the three ingredients have been properly mixed together. The second jug is needed only at the end of the process to decant the wine off the dead yeast. The warehouse contains 2 mixing stations, 6 jugs (10 litre size), 7 yeast locks, 15 containers of 5 litre size of sweetened fruit juice and 20 packages of wine yeast (for 10 litres of wine each). Once a member has finished his/her wine, they all taste the batch before that member starts a new batch. Write a program that simulates the members of the club making wine. Each member should be represented by a process. Use semaphores for synchronization. Your solution should be written in C or C++.…arrow_forwardCorrect answer will be upvoted else downvoted. Let C={c1,c2,… ,cm} (c1<c2<… <cm) be the arrangement of individuals who hold cardboards of 'C'. Let P={p1,p2,… ,pk} (p1<p2<… <pk) be the arrangement of individuals who hold cardboards of 'P'. The photograph is acceptable if and provided that it fulfills the accompanying requirements: C∪P={1,2,… ,n} C∩P=∅. ci−ci−1≤ci+1−ci(1<i<m). pi−pi−1≥pi+1−pi(1<i<k). Given a cluster a1,… ,an, kindly track down the number of good photographs fulfilling the accompanying condition: ∑x∈Cax<∑y∈Pay. The appropriate response can be huge, so output it modulo 998244353. Two photographs are unique if and provided that there exists no less than one individual who holds a cardboard of 'C' in one photograph yet holds a cardboard of 'P' in the other. Input Each test contains numerous experiments. The main line contains the number of experiments t (1≤t≤200000). Depiction of the experiments follows. The…arrow_forward
- Problem 1: The monthly payment M of a loan amount P for y years and with interest rate r can be calculated by the formula: P(r/12) M = 1-(1+r/12)-12y Calculate the monthly payment and the total payment for a $100,000 loan for 10, 11, 12, ..., 29, 30 years with an interest rate of 4.85%. Display the results in a three-column table where the first column is the number of years, the sec- ond is the monthly payment, and the third is the total payment.arrow_forwardTyped solution needarrow_forward
arrow_back_ios
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