logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

California Motors Corporation (CMC) just introduced a new luxury sedan. As part of its promotional campaign, the marketing department decided to send personalized invitations to test-drive.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Problem 1:

California Motors Corporation (CMC) just introduced a new luxury sedan. As part of its promotional campaign, the marketing department decided to send personalized invitations to test-drive the new sedan to two target groups: 1) current owners of an CMC luxury car and 2) owners of the luxury cars manufactured by CMC competitors. The cost of sending a personalized invitation is estimated to be $1 per letter. Based on previous experience with this type of advertising, CMC estimates that 25% of the customers contacted from group 1 and 10% of the customers contacted from group 2 will test-drive the new sedan. As part of this campaign, CMC has set the following goals:

  1. Get at least 10,000 customers from group 1 to test-drive the new sedan. (priority level 1)
  2. Get at least 5000 customers from group 2 to test-drive the new sedan. (priority level 1)
  3. Limit the expense of sending out the invitations to $ 70,000. (priority level 2)

Assume goals 1 and 2 are equally important.

  1. Formulate this goal programming problem (define the decision and deviation variables, objective function and constraints).
  2. Solve the program using a Python optimization library and display the results (output of the program should be displayed with the correct format).
  3. Explain and interpret the results.
  4. If management believes that contacting customers from group 2 is twice as important as

contacting customers from group 1, what should CMC do? (solve the program a second time

with the new condition and display the results)

  1. Compare the results from these two scenarios and explain what it means.
  2. Include your Python code and the output of it in one file (the results could be as comments in

the code) and your explanation in a separate file (word file).

Problem 2:

An Art Gallery is considering installing a video camera security system to reduce its insurance premiums. A diagram of the eight display rooms the gallery uses for exhibitions is shown. The openings between rooms are numbered 1 through 13. A security firm proposed that two-way cameras be installed at some room openings. Each camera has the capability to monitor the two rooms between which the camera is located. For example, if a camera were located at opening number 4, room 1 and 4 would be covered. If a camera were located at opening 11, rooms 7 and 8 would be covered. Management decided not to locate a camera system at the entrance to the display rooms.

The objective is to provide security coverage for all eight rooms using the minimum number of two-way cameras.

  1. Formulate this optimization problem and determine the decision variables, objective function and the constraints.
  2. Determine how many cameras and the location of the cameras. (by solving the optimization problem using Python. Hint: use binary decision variables to determine a camera exists at a location or not).
  3. If management wants extra security in room 7 by installing two cameras, how do you change your problem formulation to deal with this condition. (redo the problem with the addition of this condition).
  4. Display the solution to these two scenarios, i.e. the output of your optimization code with proper format and compare them.
  5. Include your Python code and the output of it in one file (the results could be as comments in the code) and your explanation in a separate file (word file).
(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

804 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

957 Answers

Hire Me
expert
Husnain SaeedComputer science

586 Answers

Hire Me
expert
Atharva PatilComputer science

758 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30