Question

Solve the following LPP using graphical method:
Maximize Z = 3x1 + 2x2
Subject to the Constraints:
 -2x1 + x2 ≤ 1
 x1 ≤ 2
 x1 + x2 ≤ 3
 x1, x2 ≥0 

14 Feb 2023
Answer :
Word Count : 295

To solve this linear programming problem using the graphical method, we start by plotting the feasible region. We can plot each constraint as a straight line and shade the region that satisfies all the constraints.

The first constraint is -2x_1 + x_2 leq 1, which can be rewritten as x_2 leq 2x_1 + 1. To plot this constraint, we can plot the line x_2 = 2x_1 _______ ___ __________ _______ _______ ____ ______ __________ ________.<br> _____ _____ ___ _______ __________ _________ _______ _________.<br> _____ _______ _________ _________ ______ ______ ______ ___ _____.<br> ________ ________ ________ ________ _________ ______ _______ ______.<br> _____ ____ __________ ________ _____ ________ ___ ___.<br> ________ ___ _____ ________ ___ ______ ________ ________ _________ ______.<br> ________ __________ ___ ___ ____ _______ __________ _____ __________ _____.<br> ________ _____ _______ ___ ____ ______ ________ _______ __________.<br> ______ _____ ____ ____ ________ ___.<br> __________ ___ ______ ___ _____ _________.<br> _________ ______ _________ _______ ___.<br> ___ ________ _______ ____ ____ _____ _______ ______ ________.<br> ____ ___ ____ ______ ________.<br> _________ ______ __________ ____ _________ ________ __________ _____ _________ ___ ______ ____.<br> ____ _______ _________ ___ __________ ____ __________ ____ _______ _______ ___.<br> ___ ________ ___ ____ ____ ________ ____ _____ _________.<br> ______ _______ _____ __________ ____ ______ _____ ______.<br> _____ ________ __________ ____ ______ __________ ____ _________ ____ ________ ____ ____.<br> _____ __________ _________ ________ _____ _____ _______ _______ ________ _______ ________ ______.<br> ___ ________ _________ ____ _____ ___ _________ ______ _____ ________.<br> ______ ______ __________ ____ ____.<br> _______ _________ ________ _____ __________ _______ _____ _________ ____ _____ __________ ____.<br> _______ ______ _______ ____ __________ _______ ____ _______.<br> _________ __________ ___ ________ ________ _______ ___ __________.<br> ______ _________ _______ _________ __________ ______ ________.<br> _____ ________ __________ ___ ______ _____.<br><a class=Get Full Answer on WhatsApp

Related Questions

Solve the following LPP using graphical method:
Maximize Z = 3x1 + 2x2
Subject to the Constraints:
 -2x1 + x2 ≤ 1
 x1 ≤ 2
 x1 + x2 ≤ 3
 x1, x2 ≥0 

The following data comprising the number of customers (in hundred) and monthly sales (in thousand Rupees): 

Number of Customers (in
hundred)		 4 6 6 8 10 14 18 20 22 26 28 30
Monthly Sales
(in thousand Rs)		 1.8 3.5 5.8 7.8 8.7 9.8 10.7 11.5 12.9 13.6 14.2 15

 Calculate the residuals and determine the standardised residuals for the model Y = 2.6185 + 0.4369 X 

Calculate seasonal indices by the ratio to moving average method from the following data:

Year
Quarter		 2001 2002 2003 2004
Q1 750 860 900 1000
Q2 600 650 720 780
Q3 540 630 660 720
Q4 590 800 850 930

Fifteen successive observations on a stationary time series are as follows:

34, 24 23 31 38 34 35 31 29 28 25 27 32 33 30

Calculate r6, r7, r8 and r9 and plot the correlogram

State whether the following statements are True or False and also give the reason in support of your answer.
a) The Set $ ={(x, y) : 0 ≤ y ≤ 5 when 0 ≤ x≤ 2 and 3≤ y≤ 5 when 2≤ x ≤ 7 } is not a convex set.
b) If 10 is added to each of the entries of the cost matrix of a 3 x 3 assignment problem, then the total cost of an optimal assignment for the changed cost matrix will increase by 10.
c) The solution to a transportation problem with m-rows (supplies) and n-columns (destinations) is feasible if number of positive allocations is m + n.
d) The Value di ≥ 3 indicates an outlying observation in regression analysis.
e) Variations which occur due to natural forces and operate in a regular and periodic manner over a span of less than or equal to one year are termed as cyclic variations

Use graphical method to minimise the time added to process the following jobs on the machines shown: 

Job 1: Sequence A B C D E
Time 3 4 2 6 2
Job 2: Sequence B C A D E
Time 5 4 3 2 6

 Calculate the total time elapsed to complete both the jobs.

A department head has four subordinates, and four tasks to be performed. The subordinates differ in efficiency, and the tasks differ in their intrinsic difficulty. His estimate, of the time each man would take to perform each task, is given in the table below:

Tasks Subordinates
E F G H
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10

How should the tasks be allocated, one to a subordinate, so as to minimise the total man hour?

IGNOU Solved Assignments Assignments Ignou Projects Project Previous Year Solved Exam Papers Notes Notes Sample Question Papers Sample Question Papers
Login Cart
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance Solve the following LPP using graphical method:Maximize Z = 3x1 + 2x
→
🟢
WhatsApp Chat Fast live messaging
→
Email Us Business enquiries & support
→