### How do you create and solve linear programming problems using Excel?

Can you show me step by step how to create and solve linear problems using Excel?

Explore BrainMass

- Anthropology
- Art, Music, and Creative Writing
- Biology
- Business
- Chemistry
- Computer Science
- Drama, Film, and Mass Communication
- Earth Sciences
- Economics
- Education
- Engineering
- English Language and Literature
- Gender Studies
- Health Sciences
- History
- International Development
- Languages
- Law
- Mathematics
- Philosophy
- Physics
- Political Science
- Psychology
- Religious Studies
- Social Work
- Sociology
- Statistics

Can you show me step by step how to create and solve linear problems using Excel?

(See attached file for full problem description) --- 1) Discuss from your own experience a case where you had to maximize or minimize something and also how you think linear programming techniques might have helped you arrive at your final decision. 2) Read the short, well-written article on the Simplex Method which

Homework problems. File is attached. --- True/False Indicate whether the sentence or statement is true or false. ______ 1. A linear programming model consists of decision variables, constraints, but no objective function. ______ 2. Linear programming models exhibit linearity among all constraint relationships and th

See attch for problem

The result of pivoting the simplex tableau x y u v M -2 1 1 0 0 0 6 4 0 -1 0 42 1 -2 0 0 1 0 About -2 (1st row, 1st column) is: a) x y u v M 1 -1/2 -1/2 0 0 0 0 7 3 1 0 84 0 -3/2 ½ 0 1

See Attch for problem

The particular solution corresponding to the simplex tableau x y u v M 0 -3 1 1 0 2 1 2 0 0 0 6 0 -4 0 5 1 10 is: a. X=2, y=6, u=10, v=0, M=0 b. X=2, y=6, u=0, v=0, M=0 c. X=6, y=0, u=0, v=0, M=10 d. X=6, y=o, u=6, v=0, M=10 e. None of the above

New cars are transported from docks in Baltimore and New York to dealerships in Pittsburgh and Philadelphia. The dealership in Pittsburgh needs 20 cars and the delaership in Philadelphia needs 15 cars. It costs $60 to transport a car from Baltimore to Pittsburgh, $45 to transport a car from Baltimore to Philadelphia, $65 to tr

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 0 0 5 0 0 1 4 The tableau above is the final one in a problem to minimize -x + 2y. The minimum value of -x + 2y

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.

(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

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

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] [

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