A company assembles three different poker sets. Each Royal Flush poker set contains 1000 poker chips, 10 decks of cards, 4 dice, and 2 dealerbuttons. Each Deluxe Diamond poker set contains 600 poker chips, 5 decks of cards, 2 dice, and one dealer button. The Full House poker setcontains 300 poker chips, 5 decks of cards, 2 dice, and one dealer button. The company has 2,900,000 poker chips, 25,000 decks of cards,10,000 dice, and 6500 dealer buttons in stock. They earn a profit of $38 for each Royal Flush poker set, $22 for each Deluxe Diamond poker set,and $12 for each Full House poker set. Use the simplex method to complete parts (a) and (b).(a) How many of each type of poker set should the company assemble to maximize profit? What is the maximum profit?Begin by finding the objective function. Let x1, X2, and x3 be the numbers of Royal Flush, Deluxe Diamond, and Ful House poker sets,respectively. What is the objective function?z=x, +2 +*3X1(Do not include the $ symbol in your answers.)

Objective Functions and Constraints: Based on the given details, the objective…

Answered: A company assembles three different…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter4: Linear Programming Models

Section: Chapter Questions

Problem 107P

See similar textbooks

Similar questions

A poker company assembles three different poker sets. Each royal flush poker set contains 1000 poker chips, 10 decks of cards, 4 dice, and two dealer buttons. Each deluxe diamond poker set contains 600 poker chips, 5 decks of cards, 2 dice, and one dealer button. The full house poker set contains 300 poker chips, 5 decks of cards, 2 dice, and one dealer button. The company has 2,900,000 poker chips, 25000 decks of cards, and 10000 dice, and 6000 dealer buttons in stock. They earn a profit of $38 for each royal flush poker set, $22 for each deluxe diamond poker set, and $12 for each full house poker set. Complete parts A and B below: a) how many of each type of Poker set should assemble to maximize profit? What is the maximum profit? Begin by finding an objective function. Let x1 be the number of royal flush poker sets, let x2 be the number of deluxe diamond poker sets, and let x3 be the number of full house poker sets. what is the objective function? z=__x1+ ___x2+ ___x3
The officers of a high school senior class are planning to rent buses and vans for a class trip. Each bus can transport 45 students, requires 2 chaperones, and costs $1,200 to rent. Each van can transport 9 students, requires 1 chaperone, and costs $90 to rent. Since there are 315 students in the senior class that may be eligible to go on the trip, the officers must plan to accommodate at least 315 students. Since only 20 parents have volunteered to serve as chaperones, the officers must plan to use at most 20 chaperones. How many vehicles of each type should the officers rent in order to minimize the transportation costs? What are the minimal transportation costs?
The Enormous State University History Department offers three courses- Ancient, Medieval and Modern History- And the chairperson is trying to decide how many sections of each to offer this semester. The department is allowed to offer 43 sections total, there are 4,700 students who would like to take a course, and there are 56 professors to teach them. Sections of Ancient History have 100 students each, sections of Medieval History hold 50 studennts each, and sections of Modern History have 200 students each. Modern History sections are taught by a team of two professors, while Ancient and Medieval History need only one professor per section. How many sections of each course should the chair schedule in order to offer al the sections that they are allowed, accomodate all the students, and give one teaching assignment to each professor? HINT [See example 2.] (Assume each section has the maximum number of students allowed.) Ancient History = Sections Medieval History…

Recommended textbooks for you

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

Practical Management Science

Operations Management

ISBN:

9781337406659

Author:

WINSTON, Wayne L.

Publisher:

Cengage,

SEE MORE TEXTBOOKS