Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 3.8, Problem 12P
Explanation of Solution
Formulating a Linear Problem
- The steps for defining a linear problem include:
- Identifying the decision variables.
- Writing the objective function.
- Mentioning the constraints.
- Explicitly stating the non-negativity restriction.
- A problem will be a linear problem if and only if the decision variables, objective function and constraints all are linear functions.
- If all the three conditions are satisfied, then it is a linear problem.
- Let
- LINDO is a software package for linear
programming and it helps to get a good feasible solution quickly. - Hence in this case, the linear problem in LINDO form is
Subject to
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
C2. Prepare a Decision Table for the Airfare Discount problem. Also write the total number of
columns in this decision table.
The passengers are treated according to three categories: Type of Flight, Frequent Flyer and
Age Group.
The possible values of each category are:
> Type of Flight: International (I), Local (L)
> Frequent Flyer: Yes (Y), No (N)
> Age Group: I (Infant: 16)
The system has four different types of discounts:
80%: Infant passengers travelling in Local flight are eligible
v 70%: Infant passengers travelling in International flight are eligible
20%: Young Frequent Flyers, travelling in International flight
15%: Other Frequent Flyers, travelling in any flight
Incident Computation
The sum of the years “at risk” of these 12 courses is 102 students-years, and there were 3 occurrence of disease. We can now compute the incident rate:
(One decimal place only. No need to include “%” sign to your answer.)
Ql: The Collatz conjecture function is defined for a positive integer m as
follows. (COO1)
g(m) = 3m+1 if m is odd
= m/2 if m is even
=1 if m=1
The repeated application of the Collatz conjecture function, as follows:
g(n), g(g(n)), g(g(g(n))), ...
e.g. If m=17, the sequence is
1. g(17) = 52
2. g(52) = 26
3. g(26) = 13
4. g(13) = 40
5. g(40) = 20
6. g(20) = 10
7. g(10) = 5
8. g(5) = 16
9. g(16) = 8
10. g(8) = 4
11. g(4) = 2
12. g(2) = 1
Thus if m=17, apply the function 12 times in order to reach m=1. Use
Recursive Function.
Chapter 3 Solutions
Introduction to mathematical programming
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 Fincos 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 - Prob. 31RPCh. 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
- TOPIC: MARKOV CHAINS A book club has 3 mailing lists: A special list M of the most senior active members. Another list R containing the regular members, and A list of regular members and names of individuals who have shown interest in club activities in the past. For each new publication, it is necessary to decide which list should be used to mail the sale announcements.sale.If after the last mailing there was a request for too few copies, the secretary uses list R with probabilityof ¼ and P with a probability of ¾.If after the last mailing there was a satisfactory response, the secretary uses the R list and the P list with equalprobabilities.If, after the preceding shipment, there was an excessive number of orders or over demand, the secretary uses list M with probability 1/3 and list P with probability ¾.list M with probability 1/3 and R with probability 2/3.If list M is used, there will be poor sales or satisfactory sales with equal probabilities; if list R is used, there will be…arrow_forwardLet us consider the data of marks scored in unit tests held in school. For each unit test, the marks scored by all students of the class is recorded. Maximum marks are 25 in each subject. The subjects are Maths, Science. Social Studies (S.St.), Hindi, and English. For simplicity, we assume there are 4 students in the class and the table below shows their marks in Unit Test 1, Unit Test 2 and Unit Test 3. Table 3.1 shows this data. Name/ Unit Subjects Test Raman 1 Raman 2 Raman 3 Zuhaire 1 Zuhaire 2 Zuhaire 3 Aashravy 1 Aashravy 2 Aashravy 3 Mishti 1 Mishti 2 Mishti 3 Table 3.1 Case Study Result Maths Science S.St. Hindi 22 21 14 20 23 22 23 24 12 15 587 18 17 21 20 19 17 15 18 19 22 25 22 21 18 18 17 15 22 21 19 20 24 19 25 25 20 20 22 24 24 25 23 15 17 21 22 24 25 Eng 21 24 23 19 15 13 22 21 23 22 23 20 Let us store the data in a DataFrame, as shown in Program 3.1: Program 3-1 Store the Result data in a DataFrame called marksUT.arrow_forwardINTRODUCTION: Heat conduction from a cylindrical solid wall of a pipe can be determined by the follow T1-T2 q = 2nLk R2 In R. where: q is the computed heat conduction in Watts. k is the thermal conductivity of the pipe material in Watts/°C/m. L is the length of the pipe in cm. Ri is the inner radius of the pipe in cm. R2 is the outer radius of the pipe in cm. Ti is the internal temperature in °C. T2 is the external temperature in °C. ASSIGNMENT: Write a C program that will allow the user to enter the inner and outer radii of the pipe, the the internal and external temperatures. Once the user enters the input values, the programarrow_forward
- For tax purposes an item may be depreciated over a period of several years, n.With the straight line method of depreciation, each year the item depreciates by 1/nth of itsoriginal value. With the double declining balance method of depreciation, each year the itemdepreciates by 2/nths of its value at the beginning of that year. (In the final year it is depreciatedby its value at the beginning of the year.)Write a program using **Visual Basic** that performs the following tasks:1.1 Request a depreciation of the item, the year of purchase, the cost of the item, the number ofyears to be depreciated (estimated life), and the method of depreciation. The method ofdepreciation should be chosen by clicking on one of two buttons.1.2 Display a year by year description of the depreciation.arrow_forwardFor each product, find the median sales quantity (assume an odd number of sales forsimplicity of presentation). (NOTE – “median” is defined as “denoting or relating to avalue or quantity lying at the midpoint of a frequency distribution of observed values orquantities, such that there is an equal probability of falling above or below it.” E.g.,Median value of the list {13, 23, 12, 16, 15, 9, 29} is 15. Report #3:PRODUCT MEDIAN_QUANT======= ============Bread 422Milk 1976. . . .arrow_forwardSuppose you are trying to make a schedule for use of the auditorium for different clubs in a school. The auditorium can be used in the afternoons from Sunday to Thursday. There are five clubs: Music, Drama, Dance, Photography, Computer. There are a few rules that must be followed: a)The auditorium can be used by only one club on a day. b)Computer club wants to use on Monday or Thursday. c)Drama club wants on Wednesday or Thursday. d)Music club is fine with any day. Dance club wants on Monday or Wednesday. e)Photography club wants on Sunday, Tuesday or Wednesday. Formulate this problem as a CSP. Draw the constraint graph. Show the steps followed by backtracking search algorithm and derive a solution.arrow_forward
- Question 1: a)Population Growth The world population data spans from 1960 to 2017. We'd like to build a predictive model that can give us the best guess at what the population growth rate in a given year might be. We will calculate the population growth rate as follows:- Growth_rate=current_year_population−previous_year_populationprevious_year_population As such, we can only calculate the growth rate for the year 1961 onwards. Write a function that takes the population_df and a country_code as input and computes the population growth rate for a given country starting from the year 1961. This function must return a return a 2-d numpy array that contains the year and corresponding growth rate for the country. Function Specifications: Should take a population_df and country_code string as input and return a numpy array as output. The array should only have two columns containing the year and the population growth rate, in other words, it should have a shape (?, 2) where ? is…arrow_forwardThe spring in the figure below is stretched from its equilibrium position at x = 0 to a positive coordinate xo. ko HINT x = 0 x = xo PE sn PE 50 The force on the spring is F and it stores elastic potential energy PESO. If the spring displacement is tripled to 3x, determine the ratio of the new force to the original force, and the ratio of the new to the original elastic potential energy, Fo Fo PESO (a) the ratio of the new force to the original force, PE ST PE SO (b) the ratio of the new to the original elastic potential energy,arrow_forwardA town wishes to build a trail between city A, city B, city C, city D, and city E. The distances, in miles, between any two of the destinations are given in the table. Use the table to answer parts (a) and (b) below. A B C D E A * 154 134 216 129 B 154 * 195 51 243 C 134 195 * 225 220 D 216 51 225 * 308 E 129 243 220 308 * a) Use Kruskal's algorithm to determine the minimum-cost spanning tree that would link each location to create the least expensive trail. Choose the correct graph below. A. ABCD154216225E129 B. ABCD15419551E129 C. ABCD15413451E129 D. ABCD154134216E129 b) If the cost of building such a trail is $3700 per mile, what is the cost of building the trail determined in part (a)? The cost is:arrow_forward
- Computer Science Investing in stocks is a way to create assets that are supposed to provide financial security over time. In solving this problem, we assume that an investor buys several shares of stock at a certain price. These shares are going to be sold later on for a different price. Obviously, if the selling price is higher than the acquisition price, the investor makes a profit, registering capital gain. If the shares are sold at a lower price, the investor has a loss, which marks a negative capital gain. This whole process is done over a period of time, and you are required to create a scenario for buying and selling shares. The assumption is that the investor sells shares in the order in which they were purchased. The goal is to calculate the capital gain over time. Suppose that you buy n shares of stock or mutual fund for d dollars each. Later, you sell some of these shares. If the sale price exceeds the purchase price, you have made a profit—a capital gain. On the other…arrow_forwardIn a recent court case, a judge cited a city for contempt and ordered a fine of $2 for the first day. Each subsequent day, until the city followed the judge's order, the fine was squared (i.e., the fine progressed as follows: $2, $4, $16, $256, $65,536, .). a, What would be the fine on day N? b. How many days would it take for the fine to reach D dollars (a Big-Oh answer will do)? 2.6arrow_forwardLet Q ={q1,...,q5} be a set of queries, A ={A1,..., A5} be a set of attributes, and S ={S1,S2,S3} be a set of sites. The matrix of Fig. 2.25a describes the attribute usage values and the matrix of Fig. 2.25b gives the application access frequencies. Assume that refi(qk) =1forall qk and Si and that A1 is the key attribute. Use the bond energy and vertical partitioning algorithms to obtain a vertical fragmentation of the set of attributes in Aarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education