×

#### Thank you for registering.

One of our academic counsellors will contact you within 1 working day.

Click to Chat

1800-1023-196

+91-120-4616500

CART 0

• 0

MY CART (5)

Use Coupon: CART20 and get 20% off on all online Study Material

ITEM
DETAILS
MRP
DISCOUNT
FINAL PRICE
Total Price: Rs.

There are no items in this cart.
Continue Shopping
• Complete JEE Main/Advanced Course and Test Series
• OFFERED PRICE: Rs. 15,900
• View Details

```Chapter 30: Linear Programming

The general form of linear programming problem is Optimize (Maximize or Minimize) Z = c1x1 + c2x2 + …... + cnxn subject to a11x1 + a12x2 + …. + a1nxn (≤, =, ≥) b1 a21x1 + a22x2 + …. + a2nxn (≤, =, ≥) b2 ….. …...  ….….. am1x1 + am2x2 + …. + amnxn (≤, =, ≥) bm x1, x2, …. , xn ≥ 0. For more details use the links given below:

Exercises of Linear Programming – Class 12th R.D. Sharma Solutions

Linear Programming Exercise 30.1

Linear Programming Exercise 30.2

Linear Programming Exercise 30.3

Linear Programming Exercise 30.4

Linear Programming Exercise 30.5

```

### Course Features

• 728 Video Lectures
• Revision Notes
• Previous Year Papers
• Mind Map
• Study Planner
• NCERT Solutions
• Discussion Forum
• Test paper with Video Solution