The linear programming problem. Minimize 5x - y subject to: -2x - 2y < 12 -3x + 2y > 0 x > 0, y > 0 is equivalent to the linear programming problem: a. Maximize 5x - y subject to: -2x -2y < 12 3x - 2y < 0 x > 0, y > 0 b. Maximize 5x-y subject to: -2x -2y < 12 -3x + 2y > 0 x >
Consider the following linear programming problem: A workshop of Peter's Potters makes vases and pitchers. Profit on a vase is $3.00; profit on a pitcher is $4.00. Each vase requires ½ hour of labor, each pitcher requires 1 hour of labor. Each item requires 1 unit of time in the kiln. Labor is limited to 4 hours per day a
The Chop is the manufacturer of the store brand of hatchets and axes sold by various home hardware supply stores. Each item consists of a hickory handle produced in the local processing facility and a steel blade forged and polished in the local machine shop. These two items are then transported to an assembly area where the b
Acme estimates it costs $1.50 per month for each unit of this appliance carried in inventory (estimated by averaging the beginning and ending inventory levels each month). Currently, Acme has 120 units in inventory on hand for the product. To maintain a level workforce, the company wants to produce at least 400 units per month.
Please help with the following problem. Canning Transport is to move goods from three factories to three distribution centers. Information about the move is given below. Give the network model and the linear programming model for this problem. Supply at Source Demand at Destination 200 A
I need some help with a network diagram and formulation of the linear programming model. A company ships computers from factories to stores per week as follows: Factory #1 produces 400 computers per week. Factory #2 produces 200 computers per week. Factory #3 produces 150 computers per week. Store #1 needs 200 computers
The following problem is something that needs to be put into tableau iterations, but I'm not sure of my answers on it... I'm catching on slowly, but would like to have something to use to check my work... This is a homework problem, but the homework is graded on participation, not correctness in this distance learning class.
Solve the following linear program by hand using the simplex method: Maximize 100 X1 + 120 X2 + 85 X3 Subject To: 3 X1 + X2 + 6 X3 <= 120 5 X1 + 8 X2 + 2 X3 <=160 X1, X2, X3 >= 0 Show all tableau iterations a. What is the optimal solution? b. Wh
The following problem is something that needs to be put into tableau iterations, but I'm not understanding what to do next. Here is the problem: ______________________________________________________ Solve the following linear program by hand using the simplex method: Minimize 3 X1 + 4 X2 + 8 X3 Subject To: 4 X1
(d) Does the conclusion of the Maximum-Minimum Theorem always hold for a bounded function f : R --> R that is continuous on R? Prove or give a counterexample. (a) Fix a, b E R, a < b. Prove that if f [a, b] -->R is continuous on [a, b] and f(x)≠0 for all x E [a, b], then 1/f(x) is bounded on [a, b]. (b) Find a, b E R, a
Each day, workers at the Gotham City Police Department work two 6-hour shifts chosen from midnight to 6AM, 6AM to noon, noon to 6PM and 6PM to midnight. The following numbers of workers are needed during each shift: 1. 15 from midnight to 6AM 2. 5 from 6AM to noon 3. 12 from noon to 6PM 4. 6 from 6PM to midnight Workers
1) Let f, g be defined on R and let c in R. Suppose that lim f = b and that g is continuous at b. Show that lim g 0 f = g(b) Note: R: real numbers g 0 f means composition of f and g 2) Let A = [0, 1) U (1,2]. Let B = [0, 1] U [2, 3]. Does the conclusion of the maximum-minimum theorem always hold for a function f: A
The Outdoor Furniture Corporation manufactures two products, benches and picnic tables, for use in yards and parks. The firm has two main resources: its carpenters (labor force) and a supply of redwood for use in the furniture. During the next production cycle, 1,200 hours of labor are available under a union agreement. The firm
Please help with the following problem. The dean of the Western College of Business must plan the school's course offering for the Fall semester. Students' demands make it necessary to offer at least 30 undergraduate and 20 graduate courses in the term. Faculty contracts also dictate that at least 60 courses be offered in to
The winner of the Texas Lotto has decided to invest $50,000 per year in the stock market. Under consideration are stocks for a petrochemical firm and a public utility. Although a long-range goal is to get the highest possible return, some consideration is given to the risk involved with the stocks. A risk index on a scale of 1-1
Please help with the following problem. A candidate for mayor in a small town has allocated $40,000 for last-minute advertising in the days preceding the election. Two types of ads will be used: radio and television. Each radio ads costs $200 and reaches an estimated 3,000 people. Each television ad costs $500 and reaches an
The Electrocomp Corporation manufactures two electrical products: air conditioners and large fans. The assembly process for each is similar in that both require a certain amount of wiring and frilling. Each air conditioner takes 3 hours or wiring and 2 hours of drilling. Each fan must go through 2 hours of wiring and 1 hour of d
Saudi Oil Company has 5000 barrels of Type A oil and 10000 barrels of Type B oil. The company sells two products: Gasoline and Heating Oil. Both products are produced by combining Type A and Type B oil. The "quality level" of Type A oil is 10 and that of Type B oil is 5. Gasoline must have an average quality level of at least 8
PROBLEM 1 1. Use this graph to answer the questions. Maximize 28X + 35Y Subject to: 12X + 15Y < 180 15X + 10Y ≥ 150 3X - 8Y < 0 X , Y > 0 a. What is the feasible region (I, II, III, IV, or V)? b. Which point (A, B, C, D, or E) is optimal?
A manufacturer of excercise equipment will begin production of two types of machines: Body Plus 100 and Body Plus 200. The Body Plus 100 consists of a frame unit, a press station, and a pec-dec station. each frame produced uses 4 hours of machining and welding time and 2 hours of finishing and painting time. Each press stat
1. Consider the simplex tableau x y u v w M [ 1 0 3 0 0 0 | 10] [ 0 0 1 0 1 0 | 0] [ 0 1 -6 0 0 0 | 3] [ 0 0 8 1 0 0 | 7] [
A brewery manufactures 3 types of beer ---lite, regular and dark. Each vat of lite beer requires 6 bags of barley, 1 bag of sugar, and 1 bag of hops. Each vat of regular beer requires 4 bags of barley, 3 bags of sugar, and 1 bag of hops. Each vat of dark beer requires 2 bags of barley, 2 bags of sugar, and 4 bags of hops. Eac
1. Solve the linear programming problem: minimize z = x + y subject to x + 2y =< 40, 2x + y =<40, x + y =<10, x >= 0, y >=0 The corner points are: (0, 10), (0, 20), (40/3, 40/3) (20, 0), (10, 0).
1. Consider the following linear programming problem: Maximize 10x + 7y subject to: X + 3y (less than or equal to symbol) 10 2x -y (less than or equal to symbol) 8 x (greater than or equal to symbol) 0, y (greater than or equal to symbol) 0 The initial simplex tableau is: (for choices, please see attachment)
I have one last work problem where my solution just doesn't to be correct Set up the objective function and constraints and then solve for the following: A company makes a single product on two separate production lines, A and B. The company's labor force is equivalent to 1,000 hours per week, and it has $3,000 outlay week
Minimize z=6x+2y subject to constraints x+y>40, x+y>16, 4x+2y>48, x>0, y>=0
1. The feasible set of a certain linear programming problem is given by the following system of linear inequalities. x + 3y (less than or equal to symbol) 6 x - y (less than or equal to symbol) 2 - 5x + y (less than or equal to symbol) 2 Without graphing this set, determine which of the
A cargo airplane operated by has three compartments for storing cargo: front, center, and back. These compartments have capacity limits on both weight and space, as summarized below: Compartment Weight Capacity (tons) Space Capacity (cu.ft.) Front Center Back 12 13 10 7,000 9,000 5,000 To ensure proper weight
PLEASE SHOW HOW TO WORK PROBLEMS 1.If two lines intersect in more than one point, then they are a. parallel b. inconsistent c. the same d. unique e. none of the above 2.Consider the following linear programming problem. A coffee merchant sells two blends of coffee. Each pound of blend A contains 80% Mocha Java and 20% J
See attached