Question

Question 6: You have been assigned to arrange the songs on the cassette version of Tarkans latest album. A cassette tape has

i want only objective function and constraints. not a Lp solver.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Decision Variables:

Let X1,X2, X3,X4, ....... X8 be the Binary variable to represent the placement on songs 1 to 8 on Side 1 of Casette;

such that:

Xi = 1 ; if song i is placed on casette side 1

   = 0 ; if song i is placed on casette side 2 ;

Objective: To Minimize the sum product of song assignment and the Length of the song.

Min Z = 4X1 + 5X2 + 3X3 + 2X4 + 4X5 + 3X6 + 5X7 + 4X8

Such that:

4X1 + 5X2 + 3X3 + 2X4 + 4X5 + 3X6 + 5X7 + 4X8 >= 14

4X1 + 5X2 + 3X3 + 2X4 + 4X5 + 3X6 + 5X7 + 4X8 <= 16

Subject to constraints:

Each side to have exactly 2 balads: Songs 1,3,5 & 8 are balads

X1 + X3 + X5 + X8 = 2

Side 1 to have at least 3 hit songs: Songs 2,4,6 & 8 are hit songs

X2 + X4 + X6 + X8 >= 3

Either Song 5 or Song 6 to be on Side 1:

X5 + X6 = 1

If Songs 2 and 4 are on side 1, Song 5 must be on side 2:

X2 + X4 + X5 <= 2

Add a comment
Know the answer?
Add Answer to:
i want only objective function and constraints. not a Lp solver. Question 6: You have been...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Many of us have large digital music collections that are not always very well organized. It...

    Many of us have large digital music collections that are not always very well organized. It would be nice to have a program that would manipulate our music collection based on attributes such as artist, album title, song title, genre, song length, number times played, and rating. For this assignment you will write a basic digital music manager (DMM). Your DMM program must have a text-based interface which allows the user to select from a main menu of options including:...

  • Objectives: (You must use loop structures to get credit for this assignment) Students in Norfolk Gardens...

    Objectives: (You must use loop structures to get credit for this assignment) Students in Norfolk Gardens Academy are very excited about the end of year school party. Victoria is playing piano. She is practicing for the end of the school year party every day for a certain amount of time depending on her schedule. It takes her N minutes to practice the first song, and each of following songs takes M minutes longer than the previous song. She has T...

  • using LP excel solver objective: i need to minimize the distance each team has to travel...

    using LP excel solver objective: i need to minimize the distance each team has to travel the distance is represented by the yellow squares (so for example for KU to travel to MW is 488 miles) constraints each place needs to have a #1, #2, #3 and #4 seed (there cannot be any repeated seeds in any of the 4 places  ) place SOUTH MW EAST WEST TEAM SEED 1 1 1 1 488 838 104 1981 527 662 149 1319...

  • Problem 1 (10 pts): Construct a mathematical model (define your variables, write an objective function and...

    Problem 1 (10 pts): Construct a mathematical model (define your variables, write an objective function and constraints). Problem 2 (10 pts): Use Excel's Solver tool to determine the optimal solution that will maximize profit. Summarize your results. In the Solver toolbox, choose "Simplex LP". Problem 3 (10 pts): Discuss the effect on the optimal solution in Problem 2 if the profit on a small table increases to $12. In the Solver toolbox, rchoose "Simplex LP". If you Copy/Paste from Problem...

  • 1. Consider the following LP: Max z 5x1 X2 st. 2x1 xS6 6x1X2S 12 Plot the constraints on the graph and identify the feasible region and determine the optimal value of the objective function and t...

    1. Consider the following LP: Max z 5x1 X2 st. 2x1 xS6 6x1X2S 12 Plot the constraints on the graph and identify the feasible region and determine the optimal value of the objective function and the values of the decision variables. 2. Priceler manufactures sedans and wagons. The number of vehides that can be sold each of the next three months are listed to Table 1. Each sedan sells for $10000 and each wagon sells for $11000. It cost $7000...

  • Use the 'Solver' add in on excel to formulate the constraints The Clarke Special Parts Company...

    Use the 'Solver' add in on excel to formulate the constraints The Clarke Special Parts Company manufactures three products: A, B, and C. Three manufacturing centers are necessary for the production process. Product A only passes through Centers 1 and 2; Products B and C must pass through all three manufacturing centers. The time required in each center to produce one unit of each of the three products is noted as follows: X1 X2 X3 Z Profit Constraints Center 1...

  • BLENDING PROBLEMS (Constraints) 1. Gas 1, 2, and 3 produced daily should equal each respective daily demand 4. At m...

    BLENDING PROBLEMS (Constraints) 1. Gas 1, 2, and 3 produced daily should equal each respective daily demand 4. At most 5,000 barrels of crude oils 1, 2, or 3 can be purchased daily 14,000 barrels of gaso line can be produced daily 7 Crude oil blended to make gas 1 must have an average octane level of at least 10 8. 9 Crude oil blended to make gas 2 must have an average octane level of at least 8 Crude...

  • Use the 'Solver' add in on excel to formulate the constraints The Clarke Special Parts Company manufactures thre...

    Use the 'Solver' add in on excel to formulate the constraints The Clarke Special Parts Company manufactures three products: A, B, and C. Three manufacturing centers are necessary for the production process. Product A only passes through Centers 1 and 2; Products B and C must pass through all three manufacturing centers. The time required in each center to produce one unit of each of the three products is noted as follows: X1 X2 X3 Z Profit Constraints Center 1...

  • Include 1 19.Using Solver, which constraints should be used if you have a capital investment budget...

    Include 1 19.Using Solver, which constraints should be used if you have a capital investment budget of $2,500,000, projects A and B are mutually exclusive, and project D must be accepted? 1 Project 620 200 352.100 1.245 600 814300 6Total =SUM(B2B5°5052 5055) 7 Constraint 1 2,500,000 8 Constraint 2 =SUM(D2 D3) 9 Constraint 3 =D5 NPV 72 658 36,418 212,150 70 925 SUM(C2C5°3052 5056) SUM(O2:05) e) $D$2:$D$5-binary: SBS6 <= $B$7; $B$8 <= 1; and SB$9 = 1 f) $B$2:$B$5 binary:...

  • the range of which the objective function coefficient can increase or decrease by before lp must...

    the range of which the objective function coefficient can increase or decrease by before lp must be recalculated and a new optimal solution is found is called the: Qu12 iStructions Show Instructions D | Question 15 5 pts The reduced cost tells you by how much a particular objective function coefficient would have to improve by before you can start producing something of that variable True False Previous Next No new data to save. Last checked at 9:27pm Submit Quiz...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT