Exam 6: Integer, Goal, and Nonlinear Programming Models

Consider the following linear programming problem: Max: 500A+700B Subject to: 2A+3B\leq35 (assembly hours) 3A+5B\leq40 (machine hours) Reformulate and solve this problem as a goal programming problem if the following goals,with their associated weights,must be met. Goal 1: Produce at least 15 units of product A;Weight 15 Goal 2: Produce at least 15 units of product B;Weight 15 Goal 3: Minimize overtime in assembly department;Weight 25 Goal 4: Minimize overtime in machine department;Weight 25 Goal 5: Achieve at least $100,000 in profit;Weight 20

A company is considering producing 8 different products for the upcoming holiday season.The profit contribution per product is illustrated below: Product Profit (\ ) 1 10 2 12 3 7 4 15 5 8 6 9 7 13 8 11 The marketing manager has imposed the following restrictions on the production mix: •Since products 1,2,and 3 are electronic gadgets,at least two of these products must be in the production mix. •Since products 4 and 5 are kids-oriented,the production mix must include no more than one of these products. •If product 7 is included in the mix,then product 8 must be included,and vice versa. Which products should be included in the mix to maximize profit?

A company produces four products each of which must undergo assembly,inspection,and packaging.The information below summarizes the hours required for each operation by each product,the total hourly capacity for each operation,and the fixed cost incurred by each product if it is produced. Each unit of product 1 sold will contribute $60 to profit,and each unit of products 2,3,and 4 contributes $65,$70,and $55,respectively.What is the optimal product mix?

The deviational variable di‾ indicates the amount by which a certain goal is:

Set up and solve the following nonlinear programming problem using Excel: Max: +2+3+53 Subject to ++\leq75 +\geq15 2+2\leq40 ,,\geq0

There is no precise way to know where to start the solution search process for an NLP model.

An integer programming problem assumes that its objective function and its constraints are linear.

Deviational variables assume the value zero if a goal is completely attained.

Rounding off the solution to an LP relaxation problem may sometimes yield an infeasible solution to an IP problem.

An investment strategy restricts the portfolio to a mix of two stocks A and B with the following price/share and annual returns: Stock Price/Share Annual Return \ 35 5\% \ 45 7\% Assume that the maximum amount available for investment is $100,000 with the following 2 prioritized investment goals: Rank R1: Obtain an annual return of at least 6%. Rank R2: Limit the investment in stock B to no more than 55% of the total investment. Assume X? = dollar amount allocated to stock A,and X? = dollar amount allocated to stock B. What is the objective function?

A company wants to select one product from a set of 3 possible products.Which of the following ensures that only one product will be selected?

An investor is considering 7 different stocks: A,B,C,D,E,F,and G.The expected annual return for each stock is provided as follows: Annual Stock Return A 9.5\% 8.0\% 7.0\% 10.0\% 8.0\% 9.0\% 10\% The investor has imposed the following restrictions regarding the composition of the portfolio: •the portfolio must include exactly one of the following stocks: either A or B. •if stock B is selected,then stock F must also be selected. •if stock D is selected,then stock E must be excluded. Which stocks should be included in the portfolio to maximize annual return?

Consider the following profit expected from each dollar (Xᵢ)spent in the following advertising media: How should the advertising budget be allocated if the company wants to spend at least $1000 on each medium without exceeding its $10,000 budget?

A marketing manager is considering the following advertising media to promote a new product. The marketing manager has established the following goals,stated in no particular order,for the advertising campaign: Goal 1: Reach at least 500,000 individuals. Goal 2: Limit the total spending to $150,000. Formulate and solve this goal programming problem.

A company wants to select 2 products from a set of four possible products.Which of the following constraints ensures that no more than 3 will be selected?