A) The ABC engineering organization is supposed to carry out 5 types of repairs through five different operations. The table below gives the time required per each repair, the daily repair capacity of the operations and the profit gained per each repair.Formulate the problem as a linear programming model to maximize the profit. Operation Time per repair(minute) time Operations min/day F H I J 20 10 12 30 18 400 В 30 28 11 13 410 C 15 19 24 26 420 D 27 13 37 14 430 E 30 29 27 17 20 415 Profit 20 19 21 18 17 /repair

A) The ABC engineering organization is supposed to carry out 5 types of repairs through five different operations. The table below gives the time required per each repair, the daily repair capacity of the operations and the profit gained per each repair.Formulate the problem as a linear programming model to maximize the profit. Operation Time per repair(minute) time Operations min/day F H I J 20 10 12 30 18 400 В 30 28 11 13 410 C 15 19 24 26 420 D 27 13 37 14 430 E 30 29 27 17 20 415 Profit 20 19 21 18 17 /repair

Name: A) The ABC engineering organization is supposed to carry out 5 types
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: A) The ABC engineering organization is supposed to carry out 5 types of repairs throughfive different operations. The table below gives the time required per each repair, thedaily repair capacity of the operations and the profit gained per each repa

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

Solve the Linear Programming Model A fruit grower has 150 acres of land available to raise two crops, A and B. It takes one dayto trim an acre of crop A and two days to trim an acre of crop B, and there are 240 days peryear available for trimming. It takes 0.3 day to pick an acre of crop A and 0.1 day to pickan acre of crop B, and there are 30 days per year available for picking. Find the number ofacres of each fruit that should be planted to maximize profit, assuming that the profit is Php140 per acre for crop A and Php 235 per acre for crop B.
Formulate a linear programming problem that can be used to solve the following question. An airline has three types of airplanes and has contracted with a tour group to provide transportation for a minimum of 70 first-class, 52 tourist, and 108 economy-class passengers. The first plane costs $4100 for the trip and can accommodate 36 first-class, 16 tourist, and 18 economy-class passengers; the second plane costs $4800 for the trip and can accommodate 8 first-class, 10 tourist, and 42 economy-class passengers; the third plane costs $6300 for the trip and can accommodate 18 first-class, 36 tourist, and 16 economy-class passengers. How many of each type of airplane should be used to minimize the operating cost? X = ---Select--- y = ---Select--- ---Select--- Z |||| ---Select--- | F = AC UB Subject to X ---Select--- 0, y ---Select--- (objective function) (first-class passengers) (tourist passengers) (economy-class passengers) 0, z ---Select--- 0 (nonnegativity constraint)
1. Set up a linear programming model of the situation described. Determine whether it is in standard form. If not make it standard. A restaurant chef is planning a meal consisting of two foods, A, and B. • Each kg of A contains 3 units of fat and 6 units of protein • Each kg of B contains 1 unit of fat and 3 units of protein The chef wants the meal to consist of at least 18 units of protein and at most 6 units of fat. If the profit that he makes is 3 dollars per kg for food A and 5 dollars for food B, how many kilograms of each food should be served so as to maximize his profit?
A dietitian in a hospital is to arrange a special diet composed of three basic foods. The diet is to include exactly 340 units of calcium, 180 units of iron, and 400 units of vitamin A The number of units per ounce of each special ingredient for each of the foods is indicated in the table. Construct a Units per Ounce Food A Food B Food C Calcium 30 10 20 Iron 10 10 20 Vitamin A mathematical model to complete parts (A) through (C) below. Use Gauss-Jordan elimination to solve the model and then interpret the solution. 30 30 Construct a mathematical model for this situation. Let the first, second, and third equations represent calcium, iron, and vitamin A, respectively. Let x, represent the number of ounces of food A, x, represent tine number of ounces of food B, and x, represent the number of ounces of food C. - 2 * 3 = X, + X, + %3D (Type integers or decimais.) 20
Formulate but do not solve the following exercise as a linear programming problem. A nutritionist at the Medical Center has been asked to prepare a special diet for certain patients. She has decided that the meals are to be prepared from Foods A and B and that the meals should contain a minimum of 390 mg of calcium, 10 mg of iron, and 40 mg of vitamin C. Each ounce of Food A contains 25 mg of calcium, 2.5 mg of iron, 2 mg of vitamin C, and 6 mg of cholesterol. Each ounce of Food B contains 25 mg of calcium, 0.5 mg of iron, 5 mg of vitamin C, and 5 mg of cholesterol. How many ounces of each type of food should be used in a meal so that the cholesterol content C (in mg) is minimized and the minimum requirements of calcium, iron, and vitamin C are met? Minimize C = subject to the constraints calcium iron vitamin C x ≥ 0 y ≥ 0
The supplies, demands, and transportation costs per unit are shown on the network. (a)Develop a linear programming model for this problem; be sure to define the variables in your model. Let x11 = amount shipped from Jefferson City to Des Moines x12 = amount shipped from Jefferson City to Kansas City x13 = amount shipped from Jefferson City to St. Louis x21 = amount shipped from Omaha to Des Moines x22 = amount shipped from Omaha to Kansas City x23 = amount shipped from Omaha to St. Louis Min ???????? s.t. From Jefferson City ?????? From Omaha ??????? To Des Moines ??????? To Kansas City ???????? To St. Louis ???????????? x11, x12, x13, x21, x22, x23 ≥ 0 (b)Solve the linear program to determine the optimal solution. Amount Cost Jefferson City–Des Moines Jefferson City–Kansas City Jefferson City–St. Louis Omaha–Des Moines Omaha–Kansas City Omaha–St. Louis Total
Formulate a linear programming problem that can be used to solve the following question. A firm has plants in Boston and Baltimore that manufacture three models of hot tubs: regular, fancy, and super. In one day the Boston plant can manufacture 44 of the regular model, 32 of the fancy model, and 20 of the super model, and costs $4500 per day to operate, whereas the Baltimore plant can manufacture 12 of the regular model, 16 of the fancy model, and 58 of the super model, and costs $2000 per day to operate. At least 300 of the regular model, 320 of the fancy model, and 680 of the super model are needed. How many days must each plant operate in order to minimize the cost? ---1pəjəs-- = X y = ---Select--- ---Select--- v F = (objective function) Subject to (regular models) (fancy models) (super models) 0A---1pajas--
Formulate a linear programming problem that can be used to solve the following question. A dealer has 8900 pounds of peanuts, 6000 pounds of almonds, and 3800 pounds of cashews to be used to make two mixtures. The first mixture wholesales for $2.40 per pound and consists of 60% peanuts, 30% almonds, and 10% cashews. The second mixture wholesales for $3.20 per pound and consists of 15% peanuts, 45% almonds, and 40% cashews. How many pounds of each mixture should the dealer make to maximize revenue? x = ---Select--- y = ---Select--- ---Select--- v|F= Subject to (objective function) (pounds of peanuts) (pounds of almonds) (pounds of cashews) x ---Select--- 0, y ---Select--- 0 (nonnegativity constraint)
Explain important characteristics of situations to which linear programming method can be successfully applied. Assume a suitable example A firm manufactures three products A, B, and Time to manufacture product A is twice that for B and thrice that for C and if the entire labour is engaged in making product A, 1,600 units of this product can be produced. These products are to be produced in the ratio 3:4:5. There is demand for at least 300, 250 and 200 units of products A, B and C and the profit earned per unit is sh. 90, sh. 40 and sh. 30 respectively. Table Raw material Requirement per unit of product (kg) Total availability (kg) A B C P 6 5 2 5,000 Q 4 7 3 6,000 Formulate the problem as a linear programming problem.