{"id":1094,"date":"2021-12-17T16:35:49","date_gmt":"2021-12-17T11:05:49","guid":{"rendered":"https:\/\/infinitylearn.com\/surge\/?p=1094"},"modified":"2022-04-15T14:53:30","modified_gmt":"2022-04-15T09:23:30","slug":"ncert-solutions-for-class-12-maths-chapter-12-linear-programming","status":"publish","type":"post","link":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/","title":{"rendered":"NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming"},"content":{"rendered":"<p><span data-contrast=\"auto\">Subject specialists have created NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming, which includes thorough solutions for reference. All of the questions from the textbook&#8217;s exercises are answered here. Students can use these answers to help them prepare for their exams. The NCERT Solutions for Class 12 provide useful solutions for improving conceptual knowledge.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335551550&quot;:6,&quot;335551620&quot;:6,&quot;335559738&quot;:240,&quot;335559739&quot;:160,&quot;335559740&quot;:256}\"> <\/span><\/p>\n<p><span data-contrast=\"auto\">The solutions are carefully solved using student-friendly terms while still adhering to the norms that must be followed when solving NCERT Solutions for Class12. Practicing these answers can be incredibly advantageous not only in terms of exams but also in terms of helping Class 12 pupils perform well in upcoming competitive exams.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335551550&quot;:6,&quot;335551620&quot;:6,&quot;335559738&quot;:240,&quot;335559739&quot;:160,&quot;335559740&quot;:256}\"> <\/span><\/p>\n<p><span data-contrast=\"auto\">The approaches for answering have been given special consideration to stay on target while not deviating from the intended answer. Because time is so important in exams, excellent time management when answering questions is essential for getting the best results.<\/span><\/p>\n<p><b><span data-contrast=\"auto\">NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming<\/span><\/b><\/p>\n\n\t\t<div class=\"download-pdf-container\">\n\t\t\t<span class=\"title\">Do you need help with your Homework? Are you preparing for Exams?<\/span>\n\t\t\t<span class=\"subtitle\">Study without Internet (Offline)<\/span>\n\t\t\t\n\t\t\t<button class=\"download-pdf-btn\" type=\"submit\"><img src=\"https:\/\/infinitylearn.com\/surge\/wp-content\/themes\/blog\/assets\/download-icon.svg\" alt=\"Download PDF icon\" width=\"18px\" height=\"18px\">Download PDF<\/button>\n\t\t<\/div>\n\t\t<div class=\"custom-model-main pdf-download-modal\">\n\t\t\t<div class=\"custom-model-inner\">\n\t\t\t\t<div class=\"close-modal-btn close-pdf-btn\">\u00d7<\/div>\n\t\t\t\t<div class=\"custom-model-wrap\">\n\t\t\t\t\t<div class=\"pop-up-content-wrap\">\n\t\t\t\t\t<div role=\"form\" class=\"wpcf7\" id=\"wpcf7-f314520-o1\" lang=\"en-US\" dir=\"ltr\">\n<div class=\"screen-reader-response\"><p role=\"status\" aria-live=\"polite\" aria-atomic=\"true\"><\/p> <ul><\/ul><\/div>\n<form action=\"\/surge\/wp-json\/wp\/v2\/posts\/1094#wpcf7-f314520-o1\" method=\"post\" class=\"wpcf7-form init\" novalidate=\"novalidate\" data-status=\"init\">\n<div style=\"display: none;\">\n<input type=\"hidden\" name=\"_wpcf7\" value=\"314520\" \/>\n<input type=\"hidden\" name=\"_wpcf7_version\" value=\"5.5.6\" \/>\n<input type=\"hidden\" name=\"_wpcf7_locale\" value=\"en_US\" \/>\n<input type=\"hidden\" name=\"_wpcf7_unit_tag\" value=\"wpcf7-f314520-o1\" \/>\n<input type=\"hidden\" name=\"_wpcf7_container_post\" value=\"0\" \/>\n<input type=\"hidden\" name=\"_wpcf7_posted_data_hash\" value=\"\" \/>\n<input type=\"hidden\" name=\"_wpcf7_recaptcha_response\" value=\"\" \/>\n<\/div>\n<div class=\"inline-form\">\n<p class=\"title\">Download PDF for Free.<br \/>\nStudy without Internet (Offline)<\/p>\n<p><span class=\"wpcf7-form-control-wrap your-first-name\"><input type=\"text\" name=\"your-first-name\" value=\"\" size=\"40\" class=\"wpcf7-form-control wpcf7-text wpcf7-validates-as-required\" id=\"user_name\" aria-required=\"true\" aria-invalid=\"false\" placeholder=\"First Name\" \/><\/span><\/p>\n<p><span class=\"wpcf7-form-control-wrap your-last-name\"><input type=\"text\" name=\"your-last-name\" value=\"\" size=\"40\" class=\"wpcf7-form-control wpcf7-text wpcf7-validates-as-required\" aria-required=\"true\" aria-invalid=\"false\" placeholder=\"Last Name\" \/><\/span><\/p>\n<p>  <label>Grade<\/label><br \/>\n  <span class=\"wpcf7-form-control-wrap your-grade\"><select name=\"your-grade\" class=\"wpcf7-form-control wpcf7-select wpcf7-validates-as-required grades-select\" aria-required=\"true\" aria-invalid=\"false\"><option value=\"\">---<\/option><option value=\"Class 1\">Class 1<\/option><option value=\"Class 2\">Class 2<\/option><option value=\"Class 3\">Class 3<\/option><option value=\"Class 4\">Class 4<\/option><option value=\"Class 5\">Class 5<\/option><option value=\"Class 6\">Class 6<\/option><option value=\"Class 7\">Class 7<\/option><option value=\"Class 8\">Class 8<\/option><option value=\"Class 9\">Class 9<\/option><option value=\"Class 10\">Class 10<\/option><option value=\"Class 11\">Class 11<\/option><option value=\"Class 12\">Class 12<\/option><\/select><\/span><\/p>\n<p>  <label>Target Exam<\/label><br \/>\n  <span class=\"wpcf7-form-control-wrap target-exam\"><select name=\"target-exam\" class=\"wpcf7-form-control wpcf7-select wpcf7-validates-as-required target-exam-select\" aria-required=\"true\" aria-invalid=\"false\"><option value=\"JEE\">JEE<\/option><option value=\"NEET\">NEET<\/option><option value=\"CBSE\">CBSE<\/option><\/select><\/span><\/p>\n<p style=\"display: flex;align-items: center;gap: 0.2rem;\">\n+91 <span class=\"wpcf7-form-control-wrap your-phone\"><input type=\"tel\" name=\"your-phone\" value=\"\" size=\"40\" maxlength=\"10\" minlength=\"10\" class=\"wpcf7-form-control wpcf7-text wpcf7-tel wpcf7-validates-as-required wpcf7-validates-as-tel\" id=\"otp_phone\" aria-required=\"true\" aria-invalid=\"false\" placeholder=\"Phone number\" \/><\/span>\n<\/p>\n<div id=\"otp_message\" class=\"otp_message\"><\/div>\n<p><label>Preferred time slot for the call<\/label><br \/>\n<span class=\"wpcf7-form-control-wrap timeslot\"><select name=\"timeslot\" class=\"wpcf7-form-control wpcf7-select\" aria-invalid=\"false\"><option value=\"\">---<\/option><option value=\"9 am\">9 am<\/option><option value=\"10 am\">10 am<\/option><option value=\"11 am\">11 am<\/option><option value=\"12 pm\">12 pm<\/option><option value=\"1 pm\">1 pm<\/option><option value=\"2 pm\">2 pm<\/option><option value=\"3 pm\">3 pm<\/option><option value=\"4 pm\">4 pm<\/option><option value=\"5 pm\">5 pm<\/option><option value=\"6 pm\">6 pm<\/option><option value=\"7 pm\">7 pm<\/option><option value=\"8pm\">8pm<\/option><option value=\"9 pm\">9 pm<\/option><option value=\"10pm\">10pm<\/option><\/select><\/span><\/p>\n<p><label>Please indicate your interest<\/label><br \/>\n<span class=\"wpcf7-form-control-wrap intent-checkbox\"><span class=\"wpcf7-form-control wpcf7-checkbox\"><span class=\"wpcf7-list-item first\"><input type=\"checkbox\" name=\"intent-checkbox[]\" value=\"Live Classes\" \/><span class=\"wpcf7-list-item-label\">Live Classes<\/span><\/span><span class=\"wpcf7-list-item\"><input type=\"checkbox\" name=\"intent-checkbox[]\" value=\"Books\" \/><span class=\"wpcf7-list-item-label\">Books<\/span><\/span><span class=\"wpcf7-list-item\"><input type=\"checkbox\" name=\"intent-checkbox[]\" value=\"Test Series\" \/><span class=\"wpcf7-list-item-label\">Test Series<\/span><\/span><span class=\"wpcf7-list-item last\"><input type=\"checkbox\" name=\"intent-checkbox[]\" value=\"Self Learning\" \/><span class=\"wpcf7-list-item-label\">Self Learning<\/span><\/span><\/span><\/span><\/p>\n<p><label>Language<\/label><br \/>\n<span class=\"wpcf7-form-control-wrap language\"><select name=\"language\" class=\"wpcf7-form-control wpcf7-select\" aria-invalid=\"false\"><option value=\"\">---<\/option><option value=\"English\">English<\/option><option value=\"Hindi\">Hindi<\/option><option value=\"Marathi\">Marathi<\/option><option value=\"Tamil\">Tamil<\/option><option value=\"Telugu\">Telugu<\/option><option value=\"Malayalam\">Malayalam<\/option><\/select><\/span><\/p>\n<p><label>Are you a Sri Chaitanya student?<\/label><br \/>\n<span class=\"wpcf7-form-control-wrap sri-chaitanya-student\"><select name=\"sri-chaitanya-student\" class=\"wpcf7-form-control wpcf7-select\" aria-invalid=\"false\"><option value=\"No\">No<\/option><option value=\"Yes\">Yes<\/option><\/select><\/span><\/p>\n<style>\n.intent-checkbox .wpcf7-checkbox{\n    display: flex;\n    flex-wrap: wrap;\n}\n.intent-checkbox .wpcf7-checkbox .wpcf7-list-item {\n    width: 50%;\n    margin: 0!important;\n    padding: 0.1rem;\n}\n<\/style>\n<p class=\"verify_otp_input\">Verify OTP Code (required)<br \/><span class=\"wpcf7-form-control-wrap phone_verify\"><input type=\"number\" name=\"phone_verify\" value=\"\" class=\"wpcf7-form-control wpcf7-number wpcf7-validates-as-required wpcf7-validates-as-number\" aria-required=\"true\" aria-invalid=\"false\" \/><\/span><\/p>\n<p><span style=\"display:none;\"><span class=\"wpcf7-form-control-wrap current-page-url\"><input type=\"text\" name=\"current-page-url\" value=\"https:\/\/_:443\/surge\/wp-json\/wp\/v2\/posts\/1094\" size=\"40\" class=\"wpcf7-form-control wpcf7dtx-dynamictext wpcf7-dynamictext\" aria-invalid=\"false\" \/><\/span><\/span><\/p>\n<style>.wpcf7-list-item{margin: 0 0.5em 0 0!important;}<\/style>\n<p class=\"title\" style=\"color: #6e6e6e;font-size:14px;font-weight:400;text-decoration: un;\"><span class=\"wpcf7-form-control-wrap acceptance-agreement\"><span class=\"wpcf7-form-control wpcf7-acceptance\"><span class=\"wpcf7-list-item\"><input type=\"checkbox\" name=\"acceptance-agreement\" value=\"1\" aria-invalid=\"false\" checked=\"checked\" \/><\/span><\/span><\/span> I agree to the <a target=\"_blank\" href=\"https:\/\/infinitylearn.com\/terms\" style=\"text-decoration: underline;\">terms and conditions<\/a> and <a target=\"_blank\" href=\"https:\/\/infinitylearn.com\/privacy\" style=\"text-decoration: underline;\">privacy policy<\/a>.<\/p>\n<p><input type=\"button\" style=\"cursor:pointer;width:auto;\" class=\"il_otp_submit\" value=\"Get OTP\" onclick=\"sendCF7OTP(this, otp_phone.value, user_name.value)\"><\/p>\n<div class=\"form-submit-btn-div\" style=\"display:none;\">\n<input type=\"submit\" value=\"Download PDF\" class=\"wpcf7-form-control has-spinner wpcf7-submit download-pdf-submit\" \/>\n<\/div>\n<\/div>\n<div class=\"wpcf7-response-output\" aria-hidden=\"true\"><\/div><\/form><\/div>\n\t\t\t\t\t<span class=\"pdf-link hidden\" data-pdf=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/Chapter-12.pdf\"><\/span>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t\t<div class=\"bg-overlay\"><\/div>\n\t\t<\/div>\n\t\t<a href=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2021\/12\/Chapter-12.pdf\" class=\"pdfemb-viewer\" style=\"\" data-width=\"max\" data-height=\"max\" data-mobile-width=\"0\"  data-scrollbar=\"both\" data-download=\"off\" data-tracking=\"on\" data-newwindow=\"on\" data-pagetextbox=\"off\" data-scrolltotop=\"on\" data-startzoom=\"100\" data-startfpzoom=\"100\" data-toolbar=\"top\" data-toolbar-fixed=\"on\">Chapter 12<br\/><\/a>\n<p><b><span data-contrast=\"none\">Beneath are the theoretical concepts covered in Class 12 Maths Chapter 12 Linear Programming:<\/span><\/b><span data-contrast=\"none\"> <\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559738&quot;:300,&quot;335559739&quot;:160,&quot;335559740&quot;:264}\"> <\/span><\/p>\n<p><b><span data-contrast=\"none\">12.1 Introduction<\/span><\/b><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">This section summarises the preceding grades&#8217; discussions of linear equations, linear inequalities, and linear inequalities applications. It uses an example to illustrate the concept of optimization problems and a subset of optimization problems known as linear programming problems. The maximization of profit while lowering the cost of a production unit is an excellent example of optimization.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><b><span data-contrast=\"none\">12.2 Linear Programming Problem and its Mathematical Formulation<\/span><\/b><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">This section contains an example of a furniture trader who is attempting to optimize revenues by experimenting with various chair and table combinations.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">12.2.1 Mathematical formulation of the problem<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"3\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">The formulation of the above-mentioned mathematical issue is further explained in this part. The non-negative restrictions, objective function, and decision variables are all defined in this document.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"3\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">An objective function can be used to define the optimal value of a linear function.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"3\" aria-setsize=\"-1\" data-aria-posinset=\"3\" data-aria-level=\"1\"><span data-contrast=\"none\">Finding the optimal value [maximum or minimum] of a linear function of variables subject to particular conditions and satisfying a set of linear constraints is a linear programming issue.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"3\" aria-setsize=\"-1\" data-aria-posinset=\"4\" data-aria-level=\"1\"><span data-contrast=\"none\">Decision variables are variables that are involved in the objective function.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"3\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">The variables are restricted by the constraints.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<p><span data-contrast=\"none\">12.2.2 Graphical method of solving linear programming problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"1\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">The definition of the feasible region, feasible and infeasible solutions, optimal solutions, and bounded and unbounded feasible solution regions are all covered in this section. It gives a quick overview of the Corner Point Method, which is used to solve linear programming issues, and includes examples.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"1\" aria-setsize=\"-1\" data-aria-posinset=\"3\" data-aria-level=\"1\"><span data-contrast=\"none\">The feasible region is defined as the region obtained by the restrictions [including non-negative constraints].<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"1\" aria-setsize=\"-1\" data-aria-posinset=\"4\" data-aria-level=\"1\"><span data-contrast=\"none\">Possible solutions are the points that fall within the practicable zone.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"1\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">Infeasible solutions are points outside of the feasible zone.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"1\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">An optimal solution is a point in the feasible zone that offers the optimal value of the objective function.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<p><b><span data-contrast=\"none\">12.3 Different Types of Linear Programming Problems<\/span><\/b><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">Different types of linear programming problems are discussed in this section.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">12.3.1 Manufacturing problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"2\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">These issues can be encountered in the manufacturing industry in order to maximize earnings while optimizing production. Profits can be determined by the number of employees, working hours, resources required, the market value of the product, demand for the product, supply of the product, and so on.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<p><span data-contrast=\"none\">12.3.2 Diet problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"7\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">Such issues entail optimizing the number of different types of foods consumed in order for the body to acquire the nutrients it requires. A diet problem&#8217;s aim will be to choose foods that provide the essential nutrition at a lower cost.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<p><span data-contrast=\"none\">12.3.3 Transportation problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"6\" aria-setsize=\"-1\" data-aria-posinset=\"3\" data-aria-level=\"1\"><span data-contrast=\"none\">These issues concern the efficient delivery of manufactured items to various locations at the lowest possible cost. The analysis of transportation costs is very important for large companies because it caters to a wide area.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<p><span data-contrast=\"none\">Students can utilize the Infinity Learn <\/span><b><span data-contrast=\"none\">NCERT Solutions for Class 12 Maths Chapter 12<\/span><\/b><span data-contrast=\"none\"> for learning any kind of complex topics.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p aria-level=\"3\"><span data-contrast=\"none\">The number of questions available in the exercise of NCERT Solutions for Class 12 Maths Chapter 12 :<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559738&quot;:300,&quot;335559739&quot;:160,&quot;335559740&quot;:264}\"> <\/span><\/p>\n<p><span style=\"color: #0000ff;\"><a style=\"color: #0000ff;\" href=\"https:\/\/infinitylearn.com\/surge\/ncert-solutions-for-class-12-maths-chapter-12-linear-programming-12-1\/\" target=\"_blank\" rel=\"noopener\">Exercise 12.1 Solutions \u2013 10 Questions <\/a><\/span><\/p>\n<p><span style=\"color: #0000ff;\"><a style=\"color: #0000ff;\" href=\"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming-exercise-12-2\/\" target=\"_blank\" rel=\"noopener\">Exercise 12.2 Solutions \u2013 11 Questions <\/a><\/span><\/p>\n<p><span style=\"color: #0000ff;\"><a style=\"color: #0000ff;\" href=\"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming-exercise-miscellaneous\/\" target=\"_blank\" rel=\"noopener\">Miscellaneous Exercise On Chapter 12 Solutions \u2013 10 Questions <\/a><\/span><\/p>\n<p aria-level=\"2\"><span data-contrast=\"none\">A few points on NCERT Class 12 Maths Chapter 12 Linear Programming<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559738&quot;:300,&quot;335559739&quot;:160,&quot;335559740&quot;:264}\"> <\/span><\/p>\n<p><span data-contrast=\"none\">The chapter Linear Programming is divided into five units, each of which is worth five points out of a possible eighty. This chapter includes two exercises as well as a miscellaneous activity to help students fully comprehend the fundamentals of linear programming. The following are some of the topics covered in Chapter 12 of NCERT Solutions for Class 12 Maths:<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<ol>\n<li><span data-contrast=\"none\"> A linear programming issue is one in which the goal is to determine the best value (maximum or minimum) of a linear function of numerous variables (called the objective function), given that the variables are non-negative and the variables satisfy a set of linear inequalities (called linear constraints). Decision variables are non-negative variables that are sometimes referred to as decision variables.<\/span><\/li>\n<\/ol>\n<ol start=\"2\">\n<li><span data-contrast=\"none\"> The important linear programming problems are listed below:<\/span><\/li>\n<\/ol>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"4\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">Diet problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"4\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">Manufacturing problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Roboto\" data-listid=\"4\" aria-setsize=\"-1\" data-aria-posinset=\"3\" data-aria-level=\"1\"><span data-contrast=\"none\">Transportation problems<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:240,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<ol start=\"3\">\n<li><span data-contrast=\"none\"> The viable region (or solution region) of a linear programming problem is the common region given by all the constraints, including the non-negative constraints x 0, y 0.<\/span><\/li>\n<li><span data-contrast=\"none\"> Possible solutions to the limitations are represented by points within and on the boundary of the viable zone.<\/span><\/li>\n<\/ol>\n<ul>\n<li data-leveltext=\"\u25cf\" data-font=\"Times New Roman\" data-listid=\"5\" aria-setsize=\"-1\" data-aria-posinset=\"1\" data-aria-level=\"1\"><span data-contrast=\"none\">A solution that is outside the feasible zone is infeasible.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<li data-leveltext=\"\u25cf\" data-font=\"Times New Roman\" data-listid=\"5\" aria-setsize=\"-1\" data-aria-posinset=\"2\" data-aria-level=\"1\"><span data-contrast=\"none\">An optimal solution is a point in the feasible zone that gives the objective function&#8217;s optimal value (maximum or minimum).<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559685&quot;:720,&quot;335559739&quot;:160,&quot;335559740&quot;:276,&quot;335559991&quot;:360}\"> <\/span><\/li>\n<\/ul>\n<ol start=\"5\">\n<li><span data-contrast=\"none\"> If the viable zone is unbounded, there may be no maximum or minimum. If it does exist, it must occur at an R corner point.<\/span><\/li>\n<li><span data-contrast=\"none\"> When addressing a linear programming issue, the corner point approach is applied.<\/span><\/li>\n<li><span data-contrast=\"none\"> If two feasible region corner points are both optimal solutions of the same kind, i.e., they yield the same maximum or minimum, then every point on the line segment connecting them is likewise an optimal solution of the same type.<\/span><\/li>\n<\/ol>\n<p><span data-contrast=\"none\">Students can Learn about the following topics by studying Linear Programming in Class 12 with NCERT Solutions: introduction, related terminologies such as constraints, objective function, optimization, different types of linear programming (L.P.) problems, mathematical formulation of L.P. problems, and more. viable and infeasible regions (bounded or unbounded), feasible and infeasible solutions, optimal feasible solutions, the graphical technique of solution for problems in two variables (up to three non-trivial constraints). Furthermore, the NCERT Solutions boosts pupils&#8217; confidence when it comes to taking future tests.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:160,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p aria-level=\"2\"><strong>Frequently Asked Questions on NCERT Solutions for Class 12 Maths Chapter 12 <\/strong><\/p>\n<ol>\n<li aria-level=\"2\"><span style=\"color: #ff0000;\">How many problems are there in each exercise of the NCERT Solutions for Class 12 Maths Chapter 12? <\/span><\/li>\n<li aria-level=\"2\"><span style=\"color: #ff0000;\">What do you mean by linear programming in Chapter 12 of NCERT Solutions for Class 12 Maths? <\/span><\/li>\n<li aria-level=\"2\"><span style=\"color: #ff0000;\">Where can I get NCERT Solutions for Class 12 Maths Chapter 12 online? <\/span><\/li>\n<\/ol>\n<p aria-level=\"3\"><strong>1. How many problems are there in each exercise of the NCERT Solutions for Class 12 Maths Chapter 12? <\/strong><\/p>\n<p><span data-contrast=\"none\">Three problems are included in Chapter 12 of the NCERT Solutions for Class 12 Maths. Exercise 12.1 contains 10 questions, Exercise 12.2 contains 11 questions, and the miscellaneous exercise contains 10 questions that span all of the concepts in this chapter. Every problem is addressed with the utmost care in order to deliver accurate solutions to the students in accordance with CBSE norms.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:460,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p aria-level=\"3\"><strong>2. What do you mean by linear programming in Chapter 12 of NCERT Solutions for Class 12 Maths? <\/strong><\/p>\n<p><span data-contrast=\"none\">Linear programming is a mathematical concept in which mathematical functions are constrained and then minimized or maximized as a result. This chapter&#8217;s objective functions and constraints are all totally linear. The minimum and maximum values of the linear functions are shown on the xy coordinate for further deductions. The basic goal of linear programming is to improve mathematical functions that are constrained by linear constraints.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:460,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p aria-level=\"3\"><strong>3. Where can I get NCERT Solutions for Class 12 Maths Chapter 12 online? <\/strong><\/p>\n<p><span data-contrast=\"none\">Infinity LEARN has the NCERT Solutions for Class 12 Maths Chapter 12 available for download. Subject specialists curate the solutions to all of the problems so that students have the best reference material to rely on. You can download chapter-by-chapter or exercise-by-exercise solutions to acquire a better understanding of the problem-solving approaches used to solve textbook issues.<\/span><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559739&quot;:460,&quot;335559740&quot;:276}\"> <\/span><\/p>\n<p><span data-ccp-props=\"{&quot;201341983&quot;:0,&quot;335559740&quot;:276}\"> <\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Subject specialists have created NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming, which includes thorough solutions for reference. [&hellip;]<\/p>\n","protected":false},"author":7,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_yoast_wpseo_focuskw":"Class 12 Maths Chapter 12 Linear Programming","_yoast_wpseo_title":"NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming","_yoast_wpseo_metadesc":"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com","custom_permalink":"study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/"},"categories":[19,31],"tags":[],"table_tags":[],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v17.9 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming<\/title>\n<meta name=\"description\" content=\"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming\" \/>\n<meta property=\"og:description\" content=\"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com\" \/>\n<meta property=\"og:url\" content=\"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/\" \/>\n<meta property=\"og:site_name\" content=\"Infinity Learn by Sri Chaitanya\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/\" \/>\n<meta property=\"article:published_time\" content=\"2021-12-17T11:05:49+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-04-15T09:23:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2025\/04\/infinitylearn.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1920\" \/>\n\t<meta property=\"og:image:height\" content=\"1008\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:site\" content=\"@InfinityLearn_\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prasad Gupta\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming","description":"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/","og_locale":"en_US","og_type":"article","og_title":"NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming","og_description":"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com","og_url":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/","og_site_name":"Infinity Learn by Sri Chaitanya","article_publisher":"https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","article_published_time":"2021-12-17T11:05:49+00:00","article_modified_time":"2022-04-15T09:23:30+00:00","og_image":[{"width":1920,"height":1008,"url":"https:\/\/infinitylearn.com\/surge\/wp-content\/uploads\/2025\/04\/infinitylearn.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_creator":"@InfinityLearn_","twitter_site":"@InfinityLearn_","twitter_misc":{"Written by":"Prasad Gupta","Est. reading time":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/infinitylearn.com\/surge\/#organization","name":"Infinity Learn","url":"https:\/\/infinitylearn.com\/surge\/","sameAs":["https:\/\/www.facebook.com\/InfinityLearn.SriChaitanya\/","https:\/\/www.instagram.com\/infinitylearn_by_srichaitanya\/","https:\/\/www.linkedin.com\/company\/infinity-learn-by-sri-chaitanya\/","https:\/\/www.youtube.com\/c\/InfinityLearnEdu","https:\/\/twitter.com\/InfinityLearn_"],"logo":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#logo","inLanguage":"en-US","url":"","contentUrl":"","caption":"Infinity Learn"},"image":{"@id":"https:\/\/infinitylearn.com\/surge\/#logo"}},{"@type":"WebSite","@id":"https:\/\/infinitylearn.com\/surge\/#website","url":"https:\/\/infinitylearn.com\/surge\/","name":"Infinity Learn by Sri Chaitanya","description":"Surge","publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/infinitylearn.com\/surge\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#webpage","url":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/","name":"NCERT Solutions for Class 12th Maths Chapter 12 Linear Programming","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/#website"},"datePublished":"2021-12-17T11:05:49+00:00","dateModified":"2022-04-15T09:23:30+00:00","description":"NCERT Solutions for Class 12 Maths Chapter 12 - Linear Programming solved by Expert Teachers as per NCERT (CBSE) Book guidelines. To get the latest 2021 copy of Class 12 Maths Chapter 12 NCERT Solutions visit infinitylearn.com","breadcrumb":{"@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/infinitylearn.com\/surge\/"},{"@type":"ListItem","position":2,"name":"NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming"}]},{"@type":"Article","@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#article","isPartOf":{"@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#webpage"},"author":{"@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/143c89c9c2f5e56ed91f96dde47b0b05"},"headline":"NCERT Solutions for Class 12 Maths Chapter 12 Linear Programming","datePublished":"2021-12-17T11:05:49+00:00","dateModified":"2022-04-15T09:23:30+00:00","mainEntityOfPage":{"@id":"https:\/\/infinitylearn.com\/surge\/study-materials\/ncert-solutions\/class-12\/maths\/chapter-12-linear-programming\/#webpage"},"wordCount":1313,"publisher":{"@id":"https:\/\/infinitylearn.com\/surge\/#organization"},"articleSection":["NCERT Solutions","NCERT Solutions For Class 12 Mathematics"],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/infinitylearn.com\/surge\/#\/schema\/person\/143c89c9c2f5e56ed91f96dde47b0b05","name":"Prasad Gupta","image":{"@type":"ImageObject","@id":"https:\/\/infinitylearn.com\/surge\/#personlogo","inLanguage":"en-US","url":"https:\/\/secure.gravatar.com\/avatar\/200104b443e586c76c46cadc113d931c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/200104b443e586c76c46cadc113d931c?s=96&d=mm&r=g","caption":"Prasad Gupta"},"url":"https:\/\/infinitylearn.com\/surge\/author\/prasad\/"}]}},"_links":{"self":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/1094"}],"collection":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/comments?post=1094"}],"version-history":[{"count":0,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/posts\/1094\/revisions"}],"wp:attachment":[{"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/media?parent=1094"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/categories?post=1094"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/tags?post=1094"},{"taxonomy":"table_tags","embeddable":true,"href":"https:\/\/infinitylearn.com\/surge\/wp-json\/wp\/v2\/table_tags?post=1094"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}