Numericals on Graphical Method of Linear Programming


0

(Graphical Method)

1.        Solve the following linear programming problem graphically and interpret the result.
Maximise     Z =   8x1 + 16x2

             Subject to            x1 + x2 \< 200;       x2 \< 125
3x1 + 6x2 \<900

x1, x2  >/ 0

 

2.        Maximise    Z =  20x1 + 30x2

            Subject to             2x1 + x2 \< 40
4x1 – x2  \< 20
x1    >/ 30
x1,x2  >/ 0

 

3.        Solve graphically :

Minimize     Z =    0.6x1 + x2

            Subject to             10x1 + 4x2 >/20
5x1 + 5x2  >/ 20
2x1 + 6x2  >/ 12
x1, x2  >/ 0

 


Like it? Share with your friends!

0
MT UVA BMS

MT UVA- University, Vocational and Affiliated Education for BMS

0 Comments


Warning: Undefined array key "html5" in /home/bmsnewco/public_html/wp-content/plugins/facebook-comments-plugin/class-frontend.php on line 140

Facebook comments:

This Website Is For Sale. Email us an offer we cannot refuse on [email protected] :)

X
Choose A Format
Personality quiz
Series of questions that intends to reveal something about the personality
Trivia quiz
Series of questions with right and wrong answers that intends to check knowledge
Poll
Voting to make decisions or determine opinions
Story
Formatted Text with Embeds and Visuals
List
The Classic Internet Listicles
Countdown
The Classic Internet Countdowns
Open List
Submit your own item and vote up for the best submission
Ranked List
Upvote or downvote to decide the best list item
Meme
Upload your own images to make custom memes
Video
Youtube and Vimeo Embeds
Audio
Soundcloud or Mixcloud Embeds
Image
Photo or GIF
Gif
GIF format