Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Problems based on LPP when feasible region is a line segment or it does not exist.
1. Maximize z = 2x+3y subject to the constraints
X + y ≤ 1
X + y ≥ 3
X, y ≥ 0
script
solution
1. Let z = 2x+3y
2. Let us draw lines X +y = 1 and x + y = 3using suitable points on the graph.
3. There is no common region satisfying the given conditions
X +y = 1 and x + y = 3
The systematic methodology developed for an operation research study with problems involving conflicting multiple objective policies and alternatives. Operation research in
procedure of modi method
how does it work
Minimization Example A farmer is advised to utilize at least 900 kg of mineral A and 1200 kg of mineral B to increase the productivity of crops in his fields.
#question.A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade
#Principles of OR
A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i
models of inventory management
Consider the LP min ?? = 50??1 + 100??2 3 ??.??. 7??1+2??2=28 2??1+12??2=24 ??1,??2=0 a. A basic solution of the constraint equations of this problem has how many basic variables,
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd