May I have the linear programming graph (or model) or plot with the given following information? 3 variables and 8 contraints Objective - Zmax = 1.85R+2.1D+2.15H Constraints: 0.15R + 0.2D + 0.25H ≤ 6000 0.25R + 0.2D + 0.15H ≤ 7500 0.25R + 0.2D + 0.15H ≤ 7500 0.10R + 0.2D + 0.25H ≤ 6000 0.25R + 0.2D + 0.20H ≤ 7500 R ≥ 10000 D ≥ 3000 H ≥ 5000

May I have the linear programming graph (or model) or plot with the given following information? 3 variables and 8 contraints Objective - Zmax = 1.85R+2.1D+2.15H Constraints: 0.15R + 0.2D + 0.25H ≤ 6000 0.25R + 0.2D + 0.15H ≤ 7500 0.25R + 0.2D + 0.15H ≤ 7500 0.10R + 0.2D + 0.25H ≤ 6000 0.25R + 0.2D + 0.20H ≤ 7500 R ≥ 10000 D ≥ 3000 H ≥ 5000

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter11: Simulation Models

Section: Chapter Questions

Problem 68P

See similar textbooks

Similar questions

3) Maximize Z= 2x, +x2 +3x 3 X+x2+2x3 <25 + X3 5 8 X2+ x3 S10 X1, X2, X3 2 0 Subject to IMe
2. Maximize subject to p = x + 2y X +3y24 2x + y 18 x ≥ 0, y ≥ 0.
Maximize p = 7x + 6y + 3z subject to x + y + z ≤ 150 x + y + z ≥ 100 x ≥ 0, y ≥ 0, z ≥ 0. p= (x, y, z)=
4. Optimal Rental Decisions in Cloud Computing Assume that AWS has the following 3 options for renting servers. Fraction of Job in one Server Description Rental Low Power Medium Power High Power $2/hr. $4/hr. $9/hr. Hour 1/8 1/6 1/3 L M Note that if you rent a server for less than one hour, you still must pay the rent for the entire hour. You have a job that must finısh in at most 5 hours. The low-power server can finish 1/8th of the job in 1 hour, the medium-power server can finish 1/6 of the job in one hour, and the high- power server can finish 1/3rd of the job in one hour. (a) The typical practice used by most firms is to find a single server that can do the work at the least cost and within the available time. Find the best sıngle server solution-that is, which single server should you use and for how many hours will you rent this server?
Maximize f = x + y subject to the following constraints: x + 2y ≤ 8 -2x + 3y ≤ 2 x ≤ 4 ≤ x 0 ≤ y
Maximize p = 10x + 20y + 15z subject to x + 2y + z ≤ 40 2y − z ≥ 10 2x − y + z ≥ 20 x ≥ 0, y ≥ 0, z ≥ 0.
variables $E$11 47000 0 35 7.0000001 8.0000001 BO Constraints Final Shadow Constraint Allowable Allowable Cell Name Value Price R.H. Side Increase Decrease $B$16 LHS 55000 41 55000 10500 47000 $B$17 LHS 72000 35 72000 10500 47000 $B$18 LHS 80000 -8 80000 47000 10500 10500 $B$19 LHS 47000 0 57500 1E+30 The answers to the questions are found in this sensitivity report. Questions: Write your responses in the space provided 1. What is the range of optimality for the BN and BO variables? write your answers in this format: Lower limit <= Coefficient of BN <= Upper limit. Example 22 <= C of BN <= 40 2. What is the range of feasibility for the constraints located on B17 and B18? 3. If the right-hand side of the constraint located on B17 is decreased by 200, what is the effect on the value of the objective function?
For a certain civil engineering system, it is sought to maximize the benefits, which is given by the expression: Z=3x+5y. The decision variables are x (the amount of resource type 1 to be used) and y (the amount of resource type 2 to be used). • The amount of resource type 1 should be at least 3 units. • The amount of resource type 2 should be at least 3 units. The difference between the amount of ● resource type 2 and the amount resource type 1 should not exceed 6. • The total amount of resource types 1 and 2 should not exceed 12 units. a. Identify the obiective function for this problem. b. Identify and write the constraints. c. Provide a sketch graph for the constraint set. d. Clearly show the feasible region. e. Label all extreme points (or vertices) of the feasible region and indicate their coordinates. f. Solve the optimization problem.
2. Maximize z = 5x1 + 2x2 subject to: 2х + 4x, < 15 Зx, + х, < 10 with х, 2 0, х — 0.
Four qualified postgraduate students are to be allocated to four professors. The preference given by student (scale 1-10) is shown as table below. Student A В C D Professor James Jordan Janet 7 8 6. Jessy 5 8. 7 (a) Formulate a linear programming model for the problem. [NOTE: Please use x, where i = 1, 2,...,n -Professor and j=1, 2,...,m -Student to represent your decision variables.] (b) From the output below, what is the optimal allocation plan and what is the total preference scales obtained from the allocation plan? Model Variable Original Value Final Value Value x11 1 1 Value x12 1 Value x13 1 Value x14 Value x21 Value x22 Value x23 1 1 1 1 1 Value x24 1 Value x31 Value x32 Value x33 1 1 1 1 Value x34 1 Value x41 1 Value x42 1 Value x43 1 Value x44 1 1 699 445
LPP Model Maximize P = 12x + 10y Subject to : 4x + 3y < 480 2x + 3y < 360 X, y 2 0 Which of the following points (x, y) is feasible? A) ( 120, 10) B ( 30, 100 ) c) ( 60, 90 ) D) ( 10, 120 )
3 II | Here are the changes to the original problem and the revised conditions for this decision-making problem: With a favorable market, John Thompson thinks a large facility would result in a net profit of $195,000 to his firm. If the market is unfavorable, the construction of a large facility would result in $185,000 net loss. A small plant would result in a net profit of $110,000 in a favorable market, but a net loss of $25,000 would occur if the market was unfavorable. Doing nothing would result in $0 profit in either market conditions. a) Create a decision table, b) What is your recommendation if you would apply the Maximax criterion (Optimistic)? Follow the guidance from your textbook and create a table. c) What is your recommendation if you would apply the Maximin Criterion (Pessimistic)? Follow the guidance from your textbook and create a table. d) What is your recommendation if you would apply the Criterion of Realism (Hurwicz Criterion) with a coefficient of realism a =…