Answered: linear programming problem

Name: Write the concept of marginal cost and linear programming problem.
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: Write the concept of marginal cost and linear programming problem.

Math

Advanced Math

linear programming problem

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Q: Objective function: 3X1 + 2X2 Subject to: 5X1- 6X2 ≤30 2X1+ X2 ≥ 80 Q: Objective function: 3X1 + 2X2 Subject to: 5X1- 6X2 ≤30 2X1+ X2 ≥ 80 X1, X2 ≥ 0 Question is: Assume the objective function is the first time is “maximize profit” and in the second time “minimize cost”. Use the simplex method to find out how many units of X1 and X2 you will produce and how much is the profit and cost. X1, X2 ≥ 0 Question is: Assume the objective function is the first time is “maximize profit” and in the second time “minimize cost”. Use the simplex method to find out how many units of X1 and X2 you will produce and how much is the profit and cost.
1. The receptionist for a veterinarian is given the task of scheduling appointments. She 18 17 16 allots 30 minutes for a routine 15 office visit and 90 minutes for a 14 surgery. The veterinarian cannot 13 do more than 3 surgeries per day. The office has 7 hours available for appointments. If an 12 11 10 9 office visit costs $75 and most surgeries cost $250, find a combination of office visits and 6 surgeries that will maximize the daily income of the clinic. 5 4 a. Define the variables: 3 2 1 12 3 4 5 6 7 8 9 10 11 12 1314 15 16 17 18 b. Write the Constraints: c. Graph the system of inequalities and calculate the vertices. d. Optimization equation: e. Solution:
State the linear programming problem in mathematical terms, identifying the objective function and the constraints. A firm makes products A and B. Product A takes 2 hours each on machine L and machine M; product B takes 2 hours on L and 3 hours on M. Machine L can be used for 14 hours and M for 9 hours Profit on product A is $7 and $6 on B. Maximize profit. OA Maximize 7A+68 Subject to: 2A + 2B < 14 2A+3859 AB20 OC. Maximize 7A-68 Subject to: 2A 20214 3A 28 20 ABSO OB. Maximize 7A 68 Subject to: 2A+28s 14 34 2859 AB20 OD. Maximize 6A+78 Subject to 2A 38 14 2A-2059 A, B20
The area of a triangle with sides of length a, b, and c is s(s - a)(s – b)(s - c), where s is half the perimeter of the triangle. We have 60 feet of fence and want to fence a triangular-shaped area. Part A: Formulate the problem as a constrained nonlinear program that will enable us to maximize the area of the fenced area, with constraints. Clearly indicate the variables, objective function, and constraints. Hint: The length of a side of a triangle must be less than or equal to the sum of the lengths of the other two sides. Part B: Solve the Program (provide exact values for all variables and the optimal objective function).
Zania Azlett and Angela Zesiger have joined forces to start A&Z Lettuce Products, a processor of packaged shredded lettuce for institutional use. Zania has years of food processing experience, and Angela has extensive commercial food preparation experience. The process will consist of opening crates of lettuce and then sorting, washing, slicing, preserving, and finally packaging the prepared lettuce. Together with help from vendors, they think they can adequately estimate demand, fixed costs, revenues, and variable cost per bag of lettuce. They think a largely manual process will have monthly fixed costs of $37,500 and variable costs of $2.00 per bag. A more mechanized process will have fixed costs of $80,000 per month with variable costs of $1.25 per bag. They expect to sell the shredded lettuce for $2.50 pe bag. a) The break-even quantity in units for the manual process = bags (round your response to the nearest whole number). b) The revenue for the manual process at the break-even…
16. Use Linear programming for following study by drawing graph. Problem definition: Beaver Creek Maximization problem Product mix problem - Beaver Creek Pottery Company: How many bowls and mugs should be produced to maximize profits given labor and materials constraints? Product resource requirements and unit profit: Resource Requirements Clay (Ib/unit) Labor Profit Product (hr/unit) ($/unit) Bowl 1. 40 Mug 2 3 50 40 hrs of labor per day 120 Ibs of clay Resource Availability: Decision Variables x; = number of bowls to produce per day number of mugs to produce per day Objective Maximize Z = $40x, + $50x, Where z = profit per day 1x, + 2x, 5 40 hours of labor Function: Resource 4x, + 3x2 s 120 pounds of clay X; 2 0; X, 20 Constraints: Non-Negativity Constraints:
please can you help with the following question with alternative working out thanks a lot
13) Z-Salon profits $12 on each manicure and $18 per haircut. A manicure takes 30 minutes and a haircut takes 50 minutes. There are 5 stylists who each work 6 hours per day (that is a total of 360 min x 5 = 1800 minutes in available labor). The salon can schedule 50 appointments per day. How many manicures and how many haircuts should be scheduled each day in order order to maximize profit? What is the maximum profit? Let’s get you started. Let x = number of manicures Let y = number of haircuts OBJECTIVE The objective (goal) is to maximize profit, P. So the objective equation is P = ______________________________________________ objective equation CONSTRAINTS: 1) 2) 3) 4) Now graph the above system of inequalities (constraints) on your graph paper: Find all vertices (corner points) of your shaded region. Plug them in one at a time into the objective. Note the one which makes P the biggest. This one is our solution. Corner Pt (x,y)…
A firm that assembles computers and computer equipment is about to start production of four types of microcomputers. Each type will require assembly time, inspection time, packaging time and storage space. The amounts of each of these resources that can be devoted to the production of the microcomputers is limited. The manager of the firm would like to determine the quantity of each microcomputer to produce in order to maximize the profit generated by sales of these microcomputers. In order to develop a suitable model of the problem, the manager has met with design and production personnel. As a result of those meetings, the manager obtained an information which was then converted into a mathematical model Thus: X1 = Quantity of type 1 to produce X2 = Quantity of type 2 to produce X3 = Quantity of type 3 to produce X4 = Quantity of type 4 to produce Zmax = 0.50X1 +0.20X2 +0.30X3 + 0.80X4 Subject to: Assembly 200X1 + 200X2+ 150X3 + 250X4 <50,000 Inspection: Packaging: Storage:…
Valencia Products makes automobile radar detectors and assembles two models. LaserStop and SpeedBuster. Both models use the same electronic components. After reviewing the components required and the profit for each model, the firm found the following linear optimization model for profit, where L is the number of LaserStop models produced and S is the number of SpeedBuster models produced. Implement the linear optimization model on a spreadsheet and use Solver to find an optimal solution. Interpret the optimal solution, identify the binding constraints, and verify the values of the slack variables Maximize Profit 125 L 138 S 18 L+12 Ss5000 6L+8554500 L20 and 520 (Availability of component A) (Availability of component B) GITTE Implement the linear optimization model and find an optimal solution. Interpret the optimal solution. The optimal solution is to produce LaserStop models and SpeedBuster models. This solution gives the (Type integers or decimals rounded to two decimal places as…
National Business Machines manufactures two models of portable printers: A and B. Each model A costs $120 to make, and each model B costs $140. The profits are $25 for each model A and $40 for each model B portable printer. If the total number of portable printers demanded per month does not exceed 2400 and the company has earmarked not more than $600,000/month for manufacturing costs, how many units of each model should National make each month to maximize its monthly profits P in dollars? (Let x represent the number of units of model A and y represent the number of units of model B.) Maximize P = $$25x+40y subject to the constraints manufacturing costs number produced Please double check and explain, im very lost
Letter d only