0-1 Binary Constraints | Integer Linear Programming | Examples - Part 1

preview_player
Показать описание
This video shows how to formulate relational/logical constraints using binary or 0-1 integer variables:
~~~~~~~~~~~
**Mutually Exclusive
**Multiple Choice
**Contingent or Conditional
**Co-requisite
**k out of n

Рекомендации по теме
Комментарии
Автор

So glad people like you exist. 2 hours of lecture only for a 5 minute video to give a better explanation.

willhughes
Автор

Literally more helpful than my lecturer, i spent many hours on this and you gave me the answer in minutes. Subscribed just cos of that u have no idea how much you helped

chobots
Автор

Such an amazing video. I thought that this video would not help me but I was wrong. it does really more than I saw in hours searching in Youtube.

hmodalzubidi
Автор

thank you so much mister. you're doing a great work for people like myself who can't pay for tutors.

lanetolsunbora
Автор

JE is the 🐐 couldn't have cleared stats without his tutorial videos, and I'm going to clear this one too 🙏🏿

innocentsimukonda
Автор

Thank you for being a life saver for my upcoming exam!

lois.
Автор

Very helpful thank you! I wish you had more videos on Linear Programming as im taking Operations Research 1.

giovannifuentes
Автор

Man … YOU ARE JUST AWESOME!! NONE LIKE YOU!! THANKS A MILLLLION

joyceassad
Автор

Just an awesome video. Very Informative.

mdabdulalim
Автор

I have done a small part of my preliminary core exam thanks to this video. thank you!

ymckaya
Автор

Great explanation and helpful video. Thank you, Joshua

ello-isa
Автор

Thank you so much for this video! The only case I cannot figure out is if you select P1, you must select P2 AND P3. I've tried so many ways and can't figure it out!

emma
Автор

abstract is very useful, saved lot of time

akshayjaiswal
Автор

This is such a helpful video! Thank you so much for sharing!!

Gribixx
Автор

Awesome video Joshua.best wishes from India.

amitkumar-ipyv
Автор

very useful, well explained. Thank You!

thkpcsp
Автор

This small
electrical repair shop supplies two types of service. Customers bring in TVs,
videos, etc. that (1) require major repair or (2) minor repair. At present, the
shop has more business than it can handle so Tom Jones wants to prioritize the
work to be performed. The firm charges £25 per hour for major repairs and £10
per hour for minor repairs. The shop currently has two trained repair
engineers, who each work a 40-hour week. Tom Jones will not allow overtime, because it is expensive, and he has the
following requirements.
All repair work must generate at least £800 income per week

Major repairs should form at least 60% of the weekly work.

Minor repairs should form at least 30% of the weekly work.

question is to formulate an LP  model for this problem in order to identify the revenue maximizing combination of the two types of work on a weekly basis.

emmanuelmark
Автор

excellent, wonderfull !! very smart of you

ehecatl
Автор

This stuff seems so confusing but really is very logical, so interesting, and great teaching Joshua!

mattreece
Автор

Hello, for the conditional case (if project 4 is not selected, project 2 must not be selected), if we consider project 2 is a prerequisite course to project 2, then constraint should be: x4 >= x2...Can you explain why you say it is x2<= x4 ?

ayatelnabawy