OPERATIONS RES APP W/ STUDENT SOL MAN
4th Edition
ISBN: 9780534662257
Author: WINSTON
Publisher: CENGAGE L
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 3.3, Problem 10P
Explanation of Solution
a.
Formulation of LP:
Given that
Here, 3 franc is needed to buy a dollar and 0.25 dollar is needed to buy franc.
Suppose it simultaneous transactions are taken place and there will be only one constraint then for maximizing the resultant number of dollars after all transactions. Set the objective function as below,
Maximize,
Explanation of Solution
b.
Graphical solution:
The graph for LP is given below,
So, it is clear that there is no optimum solution for LPP of given situation because of unbounded region in graph...
Expert Solution & Answer
Trending nowThis is a popular solution!
Students have asked these similar questions
Consider the following cryptarithmetic problem where TWO and FOUR are three and four digit numbers respectively. Which of the following constraint(s) is/are correct for modeling this problem? Assume that X1, X2 & X3 are carry overs resulting from the additions at the unit, tens and the hundreds place. Also, all digits are distinct.
Use Cryptarithmetic to solve the following example:
Where,
Variables: HELPZAR X1 X2 X3 X4
Domains: 0,1,2,3,4,5,6,7,8,9
Constraints: alldiff (HELPZAR)
L+ R= A + 10 * X2
We have to assign a number to every letter.
The numbers assign to each variable shouldn’t be duplicated.
The sum should hold.
Excercise 3.1
A book salesperson living in New York needs to visit clients in Utah, Jersey, LA, and Milan within a month. The distances between these cities are given in the table in the picture.
Find the optimal solution to the problem using the branch-and-bound method.
Please detailed :( Thank you so much
Chapter 3 Solutions
OPERATIONS RES APP W/ STUDENT SOL MAN
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
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
- IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…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_forwardVandelay Industries has 275 sales reps in order to sell its latex products, each to be assigned to one of four marketing teams. If the first team is to have four times as many members as the second team and the third team is to have five times as many members as the fourth team, how can the members be distributed among the teams?arrow_forward
- Solve the following exercise using jupyter notebook for Python, to find the objective function, variables, constraint matrix and print the graph with the optimal solution. A farm specializes in the production of a special cattle feed, which is a mixture of corn and soybeans. The nutritional composition of these ingredients and their costs are as follows: - Corn contains 0.09 g of protein and 0.02 g of fiber per gram, with a cost of.$0.30 per gram.- Soybeans contain 0.60 g of protein and 0.06 g of fiber per gram, at a cost of $0.90 per gram.0.90 per gram. The dietary needs of the specialty food require a minimum of 30% protein and a maximum of 5% fiber. The farm wishes to determine the optimum ratios of corn and soybeans to produce a feed with minimal costs while maintaining nutritional constraints and ensuring that a minimum of 800 grams of feed is used daily. Restrictions 1. The total amount of feed should be at least 800 grams per day.2. The feed should contain at least 30% protein…arrow_forwardVandelay Industries has 275 sales reps in order to sell its latex products, each to be assigned to one of four marketing teams. If the first team is to have four times as many members as the second team and the third team is to have five times as many members as the fourth team, how can the members be distributed among the teams? use python code to solve.arrow_forwardConsider the following linear programming problem: Min A + 2B s.t. A + 4B ≤ 21 2A + B ≥ 7 3A + 1.5B ≤ 21 -2A + 6B ≥ 0 A, B ≥ 0 Determine the amount of slack or surplus for each constraint. If required, round your answers to one decimal place. (1) A + 4B ≤ 21 Slack or surplus (2) 2A + B ≥ 7 Slack or surplus (3) 3A + 1.5B ≤ 21 Slack or surplus (4) -2A + 6B ≥ 0 Slack or surplusarrow_forward
- Problem 1: Consider the following knowledge base.If a student's CGPA is < 2.00, the student is on academic probation. All students who are on academic probation must meet their academic advisors before they can register. There is only one academic advisor for MBA students, Professor. Rose is an MBA student and Rose has a CGPA < 2.00. Rose must register for the semester. Answer the following questions. Represent the above knowledge base using FOL. Use the resolution algorithm to show that Rose must meet Professor.arrow_forwardThe Manhattan Tourist Problem (1) Given setting in Figure 6.4, calculate exact number of different paths by dynamic programming. (2) For a general setting, i.e., from source(0,0) to sink (n, m), how many different paths by dynamic programming?1 4 3 3 4 1 0 4 3 N 5 1arrow_forwardDraw a decision tree given problem below. A businessman must decide whether to open a new mini grocery branch or simply extend the number of hours of its operation on its existing branch with a payoff of Php150,000. According to his friend, demand at a new location can either be low or high, which he probabilities are estimated to be 35% and 65%, respectively. If a new branch is opened and demand proves to be high, the businessman may choose to operate 24hrs (payoff is Php350, 000) or to operate 12hrs (payoff is Php200,000). If a new branch is opened and demand proves to be low, there is no need to operate on a 24-hr basis but instead, they will just stick to 12-hr operation with payoff of Php100,000 or enhance marketing strategy through advertising. Projected response to advertising may either be favorable or not favorable, with estimated probabilities of 40% and 60%, respectively. If demand is favorable, the payoff grows to Php310,000 and if the response in unfavorable, the payoff is…arrow_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