1
BITSAT 2021
MCQ (Single Correct Answer)
+3
-1
The linear programming problem minimize z = 3x + 2y subject to constrains x + y $$\ge$$ 8, 3x + 5y $$\ge$$ 15, x $$\ge$$ 0 and y $$\ge$$ 0, has
Questions Asked from Linear Programming (MCQ (Single Correct Answer))
Number in Brackets after Paper Indicates No. of Questions
BITSAT Subjects
Physics
Mechanics
Units & Measurement and Dimensions Motion Laws of Motion Circular Motion Work, Energy and Power Center of Mass and Collision Rotational Motion Gravitation Simple Harmonic Motion Fluid Mechanics Elasticity Waves Heat and Thermodynamics
Optics
Electromagnetism
Electrostatics Current Electricity Capacitor Moving Charges and Magnetism Magnetism and Matter Electromagnetic Induction Alternating Current Electromagnetic Waves
Modern Physics
Chemistry
Physical Chemistry
Some Basic Concepts of Chemistry Atomic Structure States of Matter Thermodynamics Chemical Equilibrium Ionic Equilibrium Liquid Solution Redox Reactions Surface Chemistry Solid State Electrochemistry Chemical Kinetics
Inorganic Chemistry
Periodic Table and Periodicity Chemical Bonding and Molecular Structure Hydrogen and It's Compounds s-Block Elements p-Block Elements d and f Block Elements Metallurgy Coordination Compounds Environmental Chemistry
Organic Chemistry
Mathematics
Algebra
Logarithms Quadratic Equations Sequences and Series Permutations and Combinations Probability Sets and Relations Binomial Theorem Vector Algebra Three Dimensional Geometry Matrices and Determinants Statistics Mathematical Reasoning Linear Programming Complex Numbers
Trigonometry
Trigonometric Ratios & Identities Trigonometric Equations Inverse Trigonometric Functions Properties of Triangles
Calculus
Functions Limits, Continuity and Differentiability Differentiation Application of Derivatives Indefinite Integration Definite Integration Area Under The Curves Differential Equations
Coordinate Geometry
English Proficiency