Share
Explore BrainMass

Linear Programming

Linear Programming: Maximizing Revenue

Problem 3 Consider the following linear programming problem: Max Z = $15x + $20y Subject to : 8x + 5y <= 40 0.4x + y >= 4 x, y >= 0 Determine the values for x and y that will maximize revenue. See the following attached file.

Woofer Pet Foods Vitamin Content

Woofer Pet Foods produces a low-calorie dog food for overweight dogs. This product is made from beef products and grain. Each pound of beef costs $0.90, and each pound of grain costs $0.60. A pound of the dog food must contain at least 9 units of Vitamin 1 and 10 units of Vitamin 2. A pound of beef contains 10 units of Vitamin 1

Assignment Linear Programming

I think I figured this one out but wanted to be sure. I came up with 24. I have attached the problem. The table above represents the average number of sales for each of three people (A, B, C) at each of four stores (1, 2, 3, 4). With three people and four stores, assigning one person per store will mean that one store is clo

Trasportation Linear Programming

Here is a review problem for my exam. Having trouble with setting up the Excel spreadsheet. Determine how many cases should be shipped from Factory C to Assembly Plant 3. I have attached the problem (see attachment).

Transshipment Linear Programming

Please help in solving a review problem for a final exam. I am having trouble setting up the problem in Excel. The goal of the problem is to find the minimum transportation cost associated with the network. I have attached a diagram (see the attachment). The following diagram shows a transshipment network. Nodes 1, 2, and 3

Linear Programming : Objective Function

Question: A croissant shop produces 2 products: bear claws (B) and almond filled croissants (C). Each bear claw requires 6 ounces of flour, 1 ounce of yeast, and 2 TS (tablespoons) of almond paste. An almond- filled croissant requires 3 ounces of flour, 1 ounce of yeast, and 4 TS of almond paste. The company has 6600 ounces of f

Quantitative Methods : Linear Programming

1. For the linear program: Max 4A + 1B s.t. 10A + 2B < 30 3A + 2B < 12 2A + 2B < 10 A, B > 0 a. write this in standard form. b. solve the problem using the graphic solutions procedure. c. what are the values of the three slack variables at the optimal solutions? 2. Consider the follwoing linear program: Min 2A

Quantitative Methods - Linear Program Graphic Solution Procedure

1. For the linear program: Max 2A + 3B s.t. 1A + 2B < 6 5A + 3B < 15 A,B > 0 Find the optimal solution using the graphical solution procedure. What is the value of the objective function at the optimal solution? 2. Solve the following linear program using the graphical solution procedure. Max 5A + 5B s.t. 1A <

Linear Programming Models with Constraints

1. Which of the following mathematical relationships could be found in a linear programming model? And which could not (why)? a. -1A + 2B < 70 b. 2A - 2B = 50 c. 1A - 2B2 < 10 d. 3 squareroot A + 2B > 15 e. 1A + 1B = 6 f. 2A + 5B + 1AB < 25 2. Find the solutions that satisfy the following const

Vector Space Axioms, Zero Element and Geometric Method of Linear Programming

Please see the attached file for the fully formatted problems. 1) Let R+={x/0<x} (that is, the set of positive real numbers). Define the operation of addition on this set by x+y=xy. Show that with this definition there is a zero element, and that every x in R+ has an inverse. Determine what the zero element is, and for any gi

Linear Programming - Staffing

How would you define in linear programming format that an employee has to work 5 consecutive days, and then has 2 days off?

Subsets, Projection Maps, Basis and Direct Sums

Let n >= 1. Define the subsets U and W in V = F^n as follows: U = {(x_1, . . . , x_n) : x_1 + . . . + x_n = 0} W = {(x_1, . . . , x_n) : x_1 = . . . = x_n} a) Prove that U and V are subspaces of V . b) Prove that V = is the "direct sum" of U and W. c) Let (v_1, . . . v_n) = ((1, 0, . . . , 0), (0, 1, . . . , 0), . . . ,

Linear programming

I'm not sure how to go about finding the optimal solution for part a and b ( please see the attached file it includes my partial solution to the question)

Quantitative Methods - Tom's Inc.

Tom's Inc., produces various Mexican food products and sells them to Whole Foods, a chain of grocery stores located in the United States. Tom's Inc. makes two salsa products: Whole Foods Salsa and Mexico City Salsa. The two products have different blends of whole tomatoes, tomato sauce, and tomato paste. The Whole Foods Salsa

Constraints: The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry store should stock. The objective function measures profit; it is assumed that every piece stocked will be sold.

The LP problem whose output follows determines how many necklaces, bracelets, rings, and earrings a jewelry store should stock. The objective function measures profit; it is assumed that every piece stocked will be sold. Constraint 1 measures display space in units, constraint 2 measures time to set up the display in minutes.

Linear Programming Objective Function

Which of the following could be a linear programming objective function? Z = 1A + 2B / C + 3D Z = 1A + 2BC + 3D Z = 1A + 2B + 3C + 4D Z = 1A + 2B2 + 3D all of the above.

Slope of Objective Function

In a linear programming problem, the binding constraints for the optimal solution are 5X + 3Y < 30 2X + 5Y < 20. Fill in the blanks in the following sentence: As long as the slope of the objective function stays between _______ and _______, the curren

Linear Programming

The owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1

Linear programming

The linear programming problem whose output follows is used to determine how many bottles of fire red nail polish (x1), bright red nail polish (x2), basil green nail polish (x3), and basic pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be sol

Linear programming

The linear programming problem whose output follows is used to determine how many bottles of fire red nail polish (x1), bright red nail polish (x2), basic green nail polish (x3), and basic pink nail polish (x4) a beauty salon should stock. The objective function measures profit; it is assumed that every piece stocked will be so

Linear Programming

Cully furniture buys two products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet