Asking for Linear programming problems

marazmatika
Messages
3
Reaction score
0
Hello,

I'm studying operations research - linear programming maximization. minimization problems

All tasks in my textbook seem to be very easy ( I've transportation, diet ... examples )

Please if anybody knows where I can find more complicated models where you'll need to think which variables to involve and it won't be easy to guess at the first look , do not hesitate and
tell me.

you can post some problems here. even one complicated task will make a deal

I'm a new girl in this forum and though I have looked through the rules I might be breaking some of them as I'm new. Please don't resent

I've loved getting to know this forum :)

Thank you in advance
 
Physics news on Phys.org
If you google on "Linear Programing Examples" you will get more urls than I can copy here.
 
HallsofIvy said:
If you google on "Linear Programing Examples" you will get more urls than I can copy here.

Thank you for the reply

Yeah, I've tried google but I was wondering if anyone had specific COMPLICATED example

maybe somebody has been studying it and remembers tricky examples

Thanks I've searched and some of them are pretty good :)
 
Last edited:
M. Felipe Calderón has $1000 available for investment at the beginning of the trading week. At the start of every day of the week (Monday to Friday), he has the following investment opportunity available:
If he invests X dollars on that day and matches that initial investment with X/2 dollars the next day, then he will receive a total return of 2X dollars on the third day.
In order to facilitate his decision making process, M. Calderón decides to make the following assumptions:
1. If an initial investment is not matched on the subsequent day, the initial investment is lost.
2. Any return that is due on any given day can be reinvested immediately.
3. Cash carried forward from one day to the next does not accrue interest.
4. Borrowing money is not allowed.
a) Assuming that M. Calderón wishes to determine an investment schedule that maximizes his total cash on Saturday, formulate a linear program for this problem. Make sure to clearly define the decision variables and to indicate the various units/measures involved.
b) Solve this problem using Excel. Remember to provide a complete answer which includes the optimal value for each variable and the resulting profit and to include all relevant Excel outputs.
c) Reformulate the original linear program (as in a)) to account for the decision to relax assumption 2 and to suppose instead that there is a reinvestment delay of 1 day.
d) Reformulate the original linear program (as in a)) to account for the decision to relax assumption 3 and using a daily interest rate of 1%.
 
Thread 'Determine whether ##125## is a unit in ##\mathbb{Z_471}##'
This is the question, I understand the concept, in ##\mathbb{Z_n}## an element is a is a unit if and only if gcd( a,n) =1. My understanding of backwards substitution, ... i have using Euclidean algorithm, ##471 = 3⋅121 + 108## ##121 = 1⋅108 + 13## ##108 =8⋅13+4## ##13=3⋅4+1## ##4=4⋅1+0## using back-substitution, ##1=13-3⋅4## ##=(121-1⋅108)-3(108-8⋅13)## ... ##= 121-(471-3⋅121)-3⋅471+9⋅121+24⋅121-24(471-3⋅121## ##=121-471+3⋅121-3⋅471+9⋅121+24⋅121-24⋅471+72⋅121##...
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
Back
Top