Below you will find the LP code for the Dakota furniture company making tables, desks, and chairs but Missing the rule that if more than 10 tables are made, then at least 5 desks must be made. (there are spots for this in the constraints) Find the optimal profit: [a] var x1 integer >= 0; /*tables */ var x2 integer >= 0; /* desks */ var x3 integer >= 0; /* chairs */ var y binary; maximize z: 60*x1+30*x2+20*x3; c1: 8*x1+6*x2+x3 <= 488; c2: 4*x1+2*x2+1.5*x3<=210; c3: 2*x1+1.5*x2+.5*x3<=84; c4: c5: end; /* if x1 > 10 */ /* then x2 >= 5 */

Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 33P: Assume the demand for a companys drug Wozac during the current year is 50,000, and assume demand...
icon
Related questions
Question
Below you will find the LP code for the Dakota furniture company
making tables, desks, and chairs but
Missing the rule that if more than 10 tables are made,
then at least 5 desks must be made.
(there are spots for this in the constraints)
Find the optimal profit: [a]
var x1 integer >= 0; /*tables */
var x2 integer >= 0; /* desks */
var x3 integer >= 0; /* chairs */
var y binary;
maximize z: 60*x1+30*x2+20*x3;
c1: 8*x1+6*x2+x3 <= 488;
c2: 4*x1+2*x2+1.5*x3<=210;
2*x1+1.5*x2+.5*x3<=84;
c3:
c4:
c5:
end;
/* if x1 > 10 */
/* then x2 >= 5 */
Transcribed Image Text:Below you will find the LP code for the Dakota furniture company making tables, desks, and chairs but Missing the rule that if more than 10 tables are made, then at least 5 desks must be made. (there are spots for this in the constraints) Find the optimal profit: [a] var x1 integer >= 0; /*tables */ var x2 integer >= 0; /* desks */ var x3 integer >= 0; /* chairs */ var y binary; maximize z: 60*x1+30*x2+20*x3; c1: 8*x1+6*x2+x3 <= 488; c2: 4*x1+2*x2+1.5*x3<=210; 2*x1+1.5*x2+.5*x3<=84; c3: c4: c5: end; /* if x1 > 10 */ /* then x2 >= 5 */
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 4 images

Blurred answer