Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 4.17, Problem 7P
Explanation of Solution
Finding optimal solution:
Consider the cash flows in a small toy store, Toyco projects. In the below table, cash flow in each month is given.
| Month | Cash flow |
| January | -12 |
| February | -10 |
| March | -8 |
| April | -10 |
| May | -4 |
| June | 5 |
| July | -7 |
| August | -2 |
| September | 15 |
| October | 12 |
| November | -7 |
| December | 45 |
The money has to be borrowed to pay the bills. The Toyco has the following options,
Option a:
- Toyco takes a long term loan for one year at interest rate of 1%.
- The cash flow is negative from January to May. That is a total of $44 thousand required for these months.
- The cash flow is positive for the month of June. So, no money required in June.
- A $7 thousand will be required for the month of July. However, $5thousand is already in hand from previous month. So, loan amount is $2 thousand.
- For the month of August, loan amount is $2 thousand. So for the subsequent months, no loan will be required.
- Therefore, total one-time loan amount is $48 thousand.
Option b:
- Toyco takes short term loan at monthly interest rate of 1.5%. Loan is taken such that only that month’s requirements are met.
Follow the steps to find the solution,
Step 1:
Enter the required data in Excel worksheet. In excel worksheet, create columns of Month, Cash Flow, Loan Amount, and Balance Loan amount is initially set to 0. Enter the formula
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Abstract classes & Interfaces (Ch13)
5. See the code below and solve the following.
class Circle {
protected double radius;
// Default constructor
public Circle() (
}
this(1.0);
// Construct circle with specified radius
public Circle(double radius) {
}
this.radius
radius;
// Getter method for radius
public double getRadius() {
}
return radius;
// Setter method for radius
public void setRadius(double radius) {
}
this.radius = radius;
// Implement the findArea method defined in GeometricObject
public double findArea() {
}
return radius* radius * Math. PI;
// Implement the find Perimeter method defined in GeometricObject
public double findPerimeter() {
}
return 2*radius*Math.PI;
// Override the equals() method defined in the Object class
public boolean equals(Circlel circle) {
}
return this.radius == circle.getRadius();
// Override the toString() method defined in the Object class
public String toString() {
}
}
return "[Circle] radius = " + radius;
5-1. Define a class name…
6. What is Race condition? How to prevent it? [2 marks]
7. How many synchronization methods do you know and compare the differences. [2 marks]
8. Explain what are the “mutual exclusion”, “deadlock”, “livelock”, and “eventual entry”, with
the traffic intersection as an example like dinning philosophy. [2 marks]
9. For memory allocation, what are the difference between internal fragmentation and external
fragmentation. Explain with an example. [2 marks]
10. How can the virtual memory map to the physical memory. Explain with an example. [2
marks]
Your answers normally have 50 words. Less than 50 words will not get marks.
1. What is context switch between multiple processes? [2 marks]
2. Draw the memory layout for a C program. [2 marks]
3. How many states does a process has? [2 marks]
4. Compare the non-preemptitve scheduling and preemptive scheduling. [2 marks]
5. Given 4 process and their arrival times and next CPU burst times, what are the average times
and average Turnaround time, for different scheduling algorithms including:
a. First Come, First-Served (FCFS) Scheduling [2 marks]
b. Shortest-Job-First (SJF) Scheduling [2 marks]
c. Shortest-remaining-time-first [2 marks]
d. Priority Scheduling [2 marks]
e. Round Robin (RR) [2 marks]
Process
Arrival Time
Burst Time
P1
0
8
P2
1
9
P3
3
2
P4
5
4
Chapter 4 Solutions
Introduction to mathematical programming
Ch. 4.1 - Prob. 1PCh. 4.1 - Prob. 2PCh. 4.1 - Prob. 3PCh. 4.4 - Prob. 1PCh. 4.4 - Prob. 2PCh. 4.4 - Prob. 3PCh. 4.4 - Prob. 4PCh. 4.4 - Prob. 5PCh. 4.4 - Prob. 6PCh. 4.4 - Prob. 7P
Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- a database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]arrow_forwarda database with multiple tables from attributes as shown above that are in 3NF, showing PK, non-key attributes, and FK for each table? Assume the tables are already in 1NF. [Hint: 3 tables will result after deducing 1NF -> 2NF -> 3NF]arrow_forwardIf a new entity Order_Details is introduced, will it be a strong entity or weak entity? If it is a weak entity, then mention its type (ID or Non-ID, also Justify why)?arrow_forward
- Which one of the 4 Entities mention in the diagram can have a recursive relationship? Order, Product, store, customer.arrow_forwardInheritance & Polymorphism (Ch11) There are 6 classes including Person, Student, Employee, Faculty, and Staff. 4. Problem Description: • • Design a class named Person and its two subclasses named student and Employee. • Make Faculty and Staff subclasses of Employee. • A person has a name, address, phone number, and e-mail address. • • • A person has a class status (freshman, sophomore, junior and senior). Define the status as a constant. An employee has an office, salary, and date hired. A faculty member has office hours and a rank. A staff member has a title. Override the toString() method in each class to display the class name and the person's name. 4-1. Explain on how you would code this program. (1 point) 4-2. Implement the program. (2 point) 4-3. Explain your code. (2 point)arrow_forwardSuppose you buy an electronic device that you operate continuously. The device costs you $300 and carries a one-year warranty. The warranty states that if the device fails during its first year of use, you get a new device for no cost, and this new device carries exactly the same warranty. However, if it fails after the first year of use, the warranty is of no value. You plan to use this device for the next six years. Therefore, any time the device fails outside its warranty period, you will pay $300 for another device of the same kind. (We assume the price does not increase during the six-year period.) The time until failure for a device is gamma distributed with parameters α = 2 and β = 0.5. (This implies a mean of one year.) Use @RISK to simulate the six-year period. Include as outputs (1) your total cost, (2) the number of failures during the warranty period, and (3) the number of devices you own during the six-year period. Your expected total cost to the nearest $100 is _________,…arrow_forward
- Which one of the 4 Entities mention in the diagram can have a recursive relationship? If a new entity Order_Details is introduced, will it be a strong entity or weak entity? If it is a weak entity, then mention its type (ID or Non-ID, also Justify why)?arrow_forwardPlease answer the JAVA OOP Programming Assignment scenario below: Patriot Ships is a new cruise line company which has a fleet of 10 cruise ships, each with a capacity of 300 passengers. To manage its operations efficiently, the company is looking for a program that can help track its fleet, manage bookings, and calculate revenue for each cruise. Each cruise is tracked by a Cruise Identifier (must be 5 characters long), cruise route (e.g. Miami to Nassau), and ticket price. The program should also track how many tickets have been sold for each cruise. Create an object-oriented solution with a menu that allows a user to select one of the following options: 1. Create Cruise – This option allows a user to create a new cruise by entering all necessary details (Cruise ID, route, ticket price). If the maximum number of cruises has already been created, display an error message. 2. Search Cruise – This option allows to search a cruise by the user provided cruise ID. 3. Remove Cruise – This op…arrow_forwardI need to know about the use and configuration of files and folders, and their attributes in Windows Server 2019.arrow_forward
- Southern Airline has 15 daily flights from Miami to New York. Each flight requires two pilots. Flights that do not have two pilots are canceled (passengers are transferred to other airlines). The average profit per flight is $6000. Because pilots get sick from time to time, the airline is considering a policy of keeping four *reserve pilots on standby to replace sick pilots. Such pilots would introduce an additional cost of $1800 per reserve pilot (whether they fly or not). The pilots on each flight are distinct and the likelihood of any pilot getting sick is independent of the likelihood of any other pilot getting sick. Southern believes that the probability of any given pilot getting sick is 0.15. A) Run a simulation of this situation with at least 1000 iterations and report the following for the present policy (no reserve pilots) and the proposed policy (four reserve pilots): The average daily utilization of the aircraft (percentage of total flights that fly) The…arrow_forwardWhy is JAVA OOP is really difficult to study?arrow_forwardMy daughter is a Girl Scout and it is time for our cookie sales. There are 15 neighbors nearby and she plans to visit every neighbor this evening. There is a 40% likelihood that someone will be home. If someone is home, there is an 85% likelihood that person will make a purchase. If a purchase is made, the revenue generated from the sale follows the Normal distribution with mean $18 and standard deviation $5. Using @RISK, simulate our door-to-door sales using at least 1000 iterations and report the expected revenue, the maximum revenue, and the average number of purchasers. What is the probability that the revenue will be greater than $120?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