outp

My Cart

Write the dual of the following LP problem:Min.Subject to

Question


Write the dual of the following LP problem:

Min.  Z=3x_1-2x_2+4x_3

Subject to

3x_1+5x_2+4x_3\geq 7

6x_1+x_2+3x_3=4

7x_1-2x_2-x_3\leq 10

x_1,x_2,x_3\leq0


Posted on : 2024-03-10 21:03:59 | Author : IGNOU Academy | View : 45

Click Here to Order on WhatsApp

Login or SignUp to View Answer / Comment or Ask Question.. Its Free

Word Count : 287

To write the dual of the given linear programming (LP) problem, we need to follow these steps:

1. Replace each inequality constraint with a dual variable and write the corresponding dual constraint.
2. Replace each equality constraint with a dual variable and write the corresponding dual constraint.
3. If the primal problem is a minimization problem, then the dual problem will be a maximization problem, and vice versa.
_____________ _______ __________ __________ _______ ________ ___.
____________ _______ __________ ______ ___________ _____________ ____.
____________ __________ ________ __________ _______ ______ _______ __________.
____________ ___________ _____ ____________ ____________ ___ ___________ __.
____ _____________ __ ___________ _____ _____ ___________ __________ _____________ __________ ____________ ___ ____ ____________ ____________.
___ ________ ____ __ _____________ ___.
____________ ___________ ________ __ ____________ ____________ _____________ _____ ____ ___________ ____ _____________.
___________ ___________ __________ _________ ____ __________ ___ _____.
_______ _________ __ _______ _______ __________ _________ ____________ ___ ____________ ____.
__________ ____ ________ ___________ _____ ________ _______ __________ __________ ____________ ___ _____ ________ ___________ ___________.
______ _____________ __________ ________ _____________ _________ ____________ ________ _______ ________.
____ __ __________ ___________ ___________ _______ _________ ________ __________ __________ __.
___________ __ ____________ ______ _____________ ___ ______ __________ ___________.
___ ___________ ___ ___________ _____ ___ _______.
_____ ____ ______ ___________ ________ ___ _______ ____ ___ ____ ___________ __________ _______ _____ ___________.
________ ___ ___ __________ ________ ___ ___________ ___________ _____ _______ ___________ _________.
____ _________ ___ ____________ _____________ ______ ___ _____________ __________ ________ ___________ ______.
_____________ ___ _________ ____ ______ ______.
_______ ___________ ____________ ______ ___________ _________ ______.
_______ _________ __________ ___ __________ _________.
_____________ _________ __ _______ ____________ _______ __.
_________ ____ ___________ __________ __________ ___________ ______ __________ _________ ________ ____________ _________ _____________ ___________.
____________ ___ ______.
Click Here to Order Full Assignment on WhatsApp








Degree : BACHELOR DEGREE PROGRAMMES
Course Name : Bachelor Degree Programmes
Course Code : BDP
Subject Name : Operational Research
Subject Code : AOR 1
Year : 2024



IGNOU AOR 1 Solved Assignment 2024
Click Here to Order on WhatsApp

Related Question


A manager wants to the appoint 4 sales-persons to 4 different cities. If the expected profit when different persons are appointed to different cities is a given in the table below, find the assignment that will maximize the profit:

 


An investment company wants to study the investment proposals based on the profit factor. While analyzing a new investment proposal, the company estimated the probability distribution for the profit as follows:

Profit (in
thousands) 
3 5 7 9 10
Probability 0.1 0.2 0.4 0.2 0.1

Using the random numbers:

19, 7, 90, 2, 57, 28

Simulate the profit of the company for six trials.


The optimal solution of any integer linear programming problem can be obtained by rounding off the optimal solution of its LP relaxation.


 (क) एक फर्म तीन उत्पाद A, B और C बनाती है। यह दो प्रकार I एवं II का कच्चा माल प्रयोग करती है जिसकी क्रमशः 5000 और 7500 इकाइयाँ उपलब्ध हैं। प्रत्येक उत्पाद की इकाइयों के लिए आवश्यक कच्चा माल नीचे दिया गया है :

कच्चा
माल
उत्पाद की प्रति इकाई आवश्यकता
A B C
I 3 4 5
II 5 3 5

तीनों उत्पादों की न्यूनतम माँग क्रमशः 600, 650 और 500 इकाइयाँ है। मान लीजिए कि A, B और C की प्रत्येक इकाई पर लाभ क्रमशः ₹50, ₹50 और ₹ 80 है। लाभ का अधिकतमीकरण करने वाली LPP सूत्रित कीजिए। 


Customers come to a coffee shop at the average rate of 32 per day (8 hours a day) in Poisson pattern. The waiter employed to serve the customers has left the job. The owner of the shop wants to hire a new the job. The owner of the shop wants to hire a new waiter. Two applicants, Abdul and Raju, have applied for the post. The service times of Abdul and Raju are exponentially distributed with mean 12 minutes and 10 minutes, respectively. Abdul and Raju demand salaries of ₹ 135 and ₹ 165 per day, respectively. If no service is available, the average loss to the owner is ₹ 400 per day. Who among the two should be selected for the job?


For a Queuing Model (M/M/1): (GD/∞/∞) with one server, if the service rate µ increases, the expected number of customers in the system decreases.


निम्नलिखित LPP को हल करने के लिए द्वैती एकधा विधि का प्रयोग कीजिए : 5
z = 3x₁ + x₂ का न्यूनतमीकरण कीजिए
जबकि : 5
x₁ + x₂ ≥ 1
2x₁ + 3x₂ ≥ 2
x₁,x₂ ≥ 0.

Call Now
Contact Us
Welcome to IGNOU Academy

Click to Contact Us

Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088
New to IGNOU Login to Get Every Update