---
The following table is a list of all of the stocks that you have in your stock portfolio. The original purchase price, current price and your best guess for the "anticipated" price (one year into the future) is given below:
Share Price ($)
Stock # Shares Owned Purchase Current Expected In One Year
1 234 20 30 36
2 272 25 34 39
3 106 30 43 42
4 452 35 47 45
5 486 40 49 51
6 359 45 53 55
7 345 50 60 63
8 419 55 62 64
9 255 60 64 66
10 264 65 66 70

Assume that the capital gains tax rate on long term profits is 20%. In addition, selling shares incurs a transaction cost of 1% of the sale proceeds.
Suppose that you need at least $30,000 in cash today. As such, you must sell off some of your stocks.
Create an integer linear program that tells you how many shares of which stock to sell in order to get the cash you need such that the anticipated future portfolio value of the remaining stocks is maximized.
Let xi be the number of shares of stock I sell

MODEL:
! The objective;
[OBJECTIVE] MAX = (36-20)*(234-x1)+ (39-25)*(272-x2)+ (42-30)*(106-x3)+(45-35)*(452-x4)+ (51-40)*(486-x5)
+(55-45)*(359-x6)+(63-50)*(345-x7)+(64-55)*(419-x8)+ (66-60)*(255-x9)+ (70-65)*(264-x10);

Let xi be the number of shares of stock I sell
The objective we want to maximize is the value of remaining stocks, therefore for stock i, its value = (number of stocks left) * (the difference between expected price and the purchase price). So we have the following objective:
(36-20)*(234-x1)+ (39-25)*(272-x2)+ (42-30)*(106-x3)+(45-35)*(452-x4)+ (51-40)*(486-x5)+(55-45)*(359-x6)+(63-50)*(345-x7)+(64-55)*(419-x8)+ (66-60)*(255-x9)+ (70-65)*(264-x10), which can be simplified as:
16 (234-x1)+ 14 (272-x2)+ 12 (106-x3)+ 10 (452-x4)+ 11 (486-x5)
+10 (359-x6)+13 (345-x7)+ 9 (419-x8)+ 6 (255-x9)+ 5 (264-x10), or by adding the constants ...

Solution Summary

The solution creates an integer linear program from a general linear model.

Is integer values a general property of LinearProgramming problems? Explain why rounding or truncating non-integer values for the solutions is not an appropriate method for obtaining integer solutions.

Max Z = 5x1 + 6x2
Subject to: 17x1 + 8x2 <= 136
3x1 + 4x2 <= 36
x1, x2 >= 0 and integer
What is the optimal solution? Z = ? Put your answer in the form xx with no additional numbers or symbols.

1) Consider the following all-integerlinearprogram
Max 5X1 + 8X2
s.t. 6X1 + 5X2 <= 30
9X1 + 4X2 <= 36
1X1 + 2X2 <= 10
a) Find the optimal solution to the Relaxation LP.
b) Find the optimal solution to the All-inte

Given the following all-integerlinearprogram:
MAX 3x1 + 2x2
such that
3x1 + x2 <= 9
x1 + 3x2 <= 7
-x1 + x2 <= 1
x1, x2 >= 0 and integer
a. Solve the problem as a linearprogram ignoring the integer constraints. Show that the optimal solution to the linearprogram gives fractional valu

Please help with the following problem.
Indicate which of the following is an all-integerlinearprogram and which is mixed-integerlinearprogram. Write the LP Relaxation for the problem but do not attempt to solve
a. Max 30x1 + 25x2
s.t.
3x1+1.5x2<400
1.5x1+2x2<250
1x1+1x2<150
X1,x2>0and x2 integer
b. Min 3

1. Consider the following integerlinearprogramming problem.
Max Z = 3x1 + 2x2
Subject to: 3x1 + 5x2 <= 30
4x1 + 2x2 <= 28
x1 <= 8
x1, x2 >= 0 and integer
The solution to the linearprogramming relaxation is: x1 = 5.714, x2= 2.571.
What is the optimal solution to the integerlinearprogramming problem? State the value

Assistance with a sample integerlinearprogramming problem.
Max Z = 3x1 + 2x2
Subject to: 3x1 + 5x2 <= 30
4x1 = 2x2 <= 28
x1 <= 8
x1, x2 >= 0 and integer
The solution to the linearprogramming relaxation is x1 = 5.714, x2 = 2.571.
What would be the optimal s

1. IntegerProgramming Problem
Consider the following integerlinearprogramming problem
Max Z=3x1+2x2
Subject to:
3x1+5x2<=30
5X1+2x2<=28
x1<=8
x1,x2>=0 and integer
The solution to the Linearprogramming relaxation is: x1 = 5.714, x2= 2.571.
What is the Z value for the optimal solution under integer

Write program segments that accomplish each of the following tasks:
a) Calculate the integer part of the quotient when integer a is divided by integer b.
b) Calculate the integer remainder when integer a is divided by integer b.
c) Use the program pieces developed in parts (a) and (b) to write a method displayDigits tha

Problem E2
Grave City is considering the relocation of several police substations to obtain better enforcement in high-crime areas. The locations under consideration together with the areas that can be covered from these locations are given in the following table:
Potential Location for Substations