--%>

Formulating linear program of a Software company

A software company has a new product specifically designed for the lumber industry. The VP of marketing has been given a budget of $1,35,00to market the product over the quarter. She has decided that $35,000 of the budget will be spent promoting the product at the national trade show in New Orleans which will be held during this planning quarter.

Because eh product targets a specialized audience the VP has ruled out television radio and mainstream magazine advertisements. Instead she has decided to promote the product using black and white (B &W) and color ads in some or all of the followings specialized publications: Building today lumber weekly and timber world building today is a week day trade newspaper that accepts both full page and half page black and white advertising. Lumber weekly and timber world are glossy magazines that run both black and white and color ads. The VP and her staff have decided to run only full page ads in these last two publications. The circulation and advertising cost data for each outlet is summarized in the following table:

1758_softyarwe.jpg

After a discussion of the potential advertising the marketing team made the following judgment:

• A maximum of one ad should b placed in any one issue of any of the trade publications during the quarter:
• At least 50 full page ads should appear during the quarter:
• At least eight color ads should appear during the quarter:
• One ad should appear in each issue of timber world:
• At least four weeks of advertising should be placed in each of the building today and lumber weekly publications:
• No more than $40,000 should be spent on advertising in any one of the trade publications.

Formulate a linear programming model that will provide the VP and her marketing staff a marketing plan for the next quarter to maximize audience exposure for their new software product.

Implement your formulation in excel and find the optimal solution using solver. Sum marize your solution (decision variable values and objective function value ) below your formulation.

   Related Questions in Mathematics

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

  • Q : Abstract Boolean Algebra I. Boolean

    I. Boolean Algebra Define an abstract Boolean Algebra, B,  as follows:  The three operations are:  +   ( x + y addition) ( x y multiplic

  • Q : Problem on Maple (a) Solve the

    (a) Solve the following  by: (i) First reducing the system of first order differentiat equations to a second order differential equation. (ii) Decoupling the following linear system of equa

  • Q : Explain lognormal stochastic

    Explain lognormal stochastic differential equation for evolution of an asset.

  • Q : Problem on Linear equations Anny, Betti

    Anny, Betti and Karol went to their local produce store to bpought some fruit. Anny bought 1 pound of apples and 2 pounds of bananas and paid $2.11.  Betti bought 2 pounds of apples and 1 pound of grapes and paid $4.06.  Karol bought 1 pound of bananas and 2

  • Q : Who derived the Black–Scholes Equation

    Who derived the Black–Scholes Equation?

  • Q : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

  • Q : Elasticity of Demand For the demand

    For the demand function D(p)=410-0.2p(^2), find the maximum revenue.

  • Q : What is Non-Logical Vocabulary

    Non-Logical Vocabulary: 1. Predicates, called also relation symbols, each with its associated arity. For our needs, we may assume that the number of predicates is finite. But this is not essential. We can have an infinite list of predicates, P

  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f