If you are not sure if the website you would like to visit is secure, you can verify it here. Enter the website address of the page and see parts of its content and the thumbnail images on this site. None (if any) dangerous scripts on the referenced page will be executed. Additionally, if the selected site contains subpages, you can verify it (review) in batches containing 5 pages.
favicon.ico: en.wikipedia.org/wiki/Mixed_integer_programming - Linear programming - Wikipedia.

site address: en.wikipedia.org/wiki/Mixed_integer_programming redirected to: en.wikipedia.org/wiki/Mixed_integer_programming

site title: Linear programming - Wikipedia

Our opinion (on Sunday 04 October 2026 2:28:10 UTC):

GREEN status (no comments) - no comments
After content analysis of this website we propose the following hashtags:


Hashtags existing on this website:




Meta tags:

Headings (most frequently used words):

algorithm, of, algorithms, and, form, linear, programming, example, optimal, interior, point, methods, simplex, vaidya, time, contents, history, uses, standard, augmented, slack, duality, complementary, slackness, theory, open, problems, recent, work, integer, unknowns, integral, programs, solvers, scripting, languages, see, also, notes, references, further, reading, external, links, covering, packing, dualities, existence, solutions, vertices, rays, polyhedra, basis, exchange, ellipsoid, following, khachiyan, comparison, examples, dantzig, active, set, criss, cross, projective, karmarkar, 87, 89, input, sparsity, current, matrix, multiplication,

Text of the page (most frequently used words):
the (411), and (216), #linear (175), #programming (136), for (107), mathbf (85), displaystyle (78), algorithm (72), problem (68), problems (64), that (54), optimization (52), with (51), are (51), algorithms (43), simplex (40), integer (39), edit (39), function (37), time (35), this (34), method (34), dual (34), methods (33), feasible (31), has (30), point (29), variables (29), set (28), bmatrix (28), primal (27), matrix (27), can (27), form (27), then (26), optimal (24), objective (24), theory (23), which (23), polynomial (23), solution (23), not (22), from (21), dantzig (21), general (21), programs (21), also (21), geq (21), language (20), interior (20), constraints (20), number (20), such (19), integral (19), mathematical (18), solver (18), polytope (18), convex (17), nonlinear (17), constraint (17), leq (17), begin (17), end (17), was (16), isbn (16), solving (16), program (16), solutions (15), doi (15), its (15), there (15), value (15), one (14), springer (14), subject (14), top (14), new (13), example (13), case (13), may (12), criss (12), cross (12), maximum (12), region (12), modeling (12), model (12), covering (12), following (12), some (12), slack (12), cdot (12), more (11), other (11), mixed (11), karmarkar (11), ellipsoid (11), 978 (11), computer (11), science (11), inequalities (11), all (11), solve (11), open (11), find (11), where (11), practical (11), have (11), maximize (11), packing (11), non (10), bound (10), khachiyan (10), verlag (10), mathematics (10), pivot (10), large (10), possible (10), any (10), duality (10), languages (9), available (9), basis (9), augmented (9), functions (9), many (9), scale (9), research (9), current (9), see (9), standard (9), two (9), zero (9), search (8), about (8), quadratic (8), minimum (8), terlaky (8), library (8), george (8), kantorovich (8), multiplication (8), vaidya (8), numerical (8), economic (8), into (8), source (8), only (8), known (8), optimum (8), every (8), however (8), feasibility (8), vertex (8), vertices (8), when (8), toggle (7), wikipedia (7), text (7), use (7), short (7), branch (7), analysis (7), s2cid (7), cite (7), uses (7), max (7), operations (7), several (7), used (7), api (7), free (7), matlab (7), but (7), efficiently (7), polyhedron (7), worst (7), infeasible (7), been (7), diameter (7), strongly (7), whether (7), main (7), work (7), variable (7), negative (7), pesticide (7), view (6), using (6), license (6), page (6), pages (6), combinatorial (6), active (6), section (6), 1997 (6), press (6), john (6), tamás (6), 1007 (6), citeseerx (6), graphs (6), song (6), lps (6), lee (6), computing (6), von (6), neumann (6), price (6), system (6), java (6), version (6), routines (6), developed (6), both (6), bounded (6), python (6), mip (6), found (6), integers (6), since (6), solved (6), these (6), than (6), theoretical (6), first (6), tilde (6), theorem (6), fertilizer (6), land (6), kilograms (6), displaying (5), descriptions (5), redirect (5), targets (5), links (5), retrieved (5), exchange (5), flow (5), graph (5), pivoting (5), projective (5), gradient (5), constrained (5), york (5), polytopes (5), wiley (5), edition (5), 2015 (5), 2003 (5), polyhedra (5), complexity (5), padberg (5), extensions (5), foundations (5), symposium (5), series (5), help (5), journal (5), 1987 (5), equilibrium (5), 2011 (5), planning (5), leonid (5), statistical (5), solvers (5), global (5), include (5), finding (5), between (5), total (5), rather (5), they (5), likewise (5), required (5), called (5), their (5), independent (5), would (5), does (5), alpha (5), article (5), move (5), each (5), unbounded (5), exists (5), direction (5), principle (5), cover (5), mathsf (5), wheat (5), barley (5), subsection (5), contents (4), 2026 (4), deprecated (4), description (4), local (4), network (4), approximation (4), plane (4), newton (4), line (4), external (4), level (4), optimizer (4), schrijver (4), second (4), introduction (4), 1979 (4), computational (4), 2001 (4), resources (4), academic (4), applications (4), university (4), thapa (4), basic (4), finite (4), jstor (4), 1947 (4), production (4), pdf (4), zhang (4), arxiv (4), faster (4), annual (4), requires (4), algebra (4), game (4), economics (4), study (4), least (4), input (4), modelling (4), ampl (4), specific (4), based (4), purpose (4), including (4), development (4), through (4), decision (4), limited (4), forms (4), similar (4), licenses (4), name (4), gpl (4), well (4), like (4), always (4), hard (4), real (4), values (4), mid (4), most (4), contrast (4), special (4), fact (4), questions (4), variants (4), edges (4), performance (4), recent (4), exist (4), unsolved (4), while (4), admit (4), cost (4), complementary (4), much (4), defined (4), after (4), need (4), working (4), simple (4), polygon (4), let (4), denote (4), implies (4), combination (4), resource (4), must (4), corresponding (4), minimize (4), area (4), maximized (4), expressed (4), transportation (4), history (4), hide (4), sidebar (4), code (3), under (3), apply (3), profit (3), wayback (3), different (3), states (3), revised (3), complementarity (3), software (3), edmonds (3), path (3), cut (3), dynamic (3), affine (3), wolfe (3), minimization (3), powell (3), symmetric (3), hall (3), optimisation (3), graduate (3), gerard (3), sierksma (3), practice (3), alexander (3), sons (3), 471 (3), 540 (3), michael (3), half (3), intersection (3), further (3), 2002 (3), account (3), related (3), beasley (3), oxford (3), vol (3), file (3), 103 (3), advances (3), parameter (3), 395 (3), 1977 (3), discrete (3), 1016 (3), decomposition (3), mukund (3), stanford (3), behavior (3), random (3), rules (3), koopmans (3), maximization (3), hitchcock (3), optimj (3), computation (3), archived (3), www (3), lines (3), mit (3), zhao (3), yin (3), tat (3), 2019 (3), focs (3), efficient (3), 1989 (3), applied (3), exponential (3), volume (3), topics (3), 1984 (3), original (3), structural (3), type (3), scheduling (3), systems (3), gams (3), excel (3), nag (3), continuous (3), alglib (3), models (3), tool (3), hand (3), brief (3), info (3), various (3), support (3), format (3), equalities (3), apache (3), information (3), matching (3), importance (3), made (3), say (3), important (3), solvable (3), because (3), those (3), polytopal (3), edge (3), result (3), proved (3), interest (3), fundamental (3), types (3), better (3), improved (3), omega (3), runs (3), takes (3), proposed (3), otherwise (3), upper (3), given (3), equivalent (3), certain (3), inequality (3), concave (3), vector (3), coefficients (3), slackness (3), examples (3), vectors (3), converted (3), becomes (3), unused (3), limit (3), revenue (3), farmer (3), hectare (3), representation (3), best (3), assignment (3), leontief (3), optimizing (3), tools (3), add (2), topic (2), table (2), contact (2), privacy (2), policy (2), additional (2), terms (2), wikimedia (2), inc (2), commons (2), last (2), categories (2), via (2), link (2), articles (2), august (2), cs1 (2), chinese (2), sources (2), wikidata (2), complete (2), https (2), org (2), index (2), php (2), international (2), lemke (2), metaheuristics (2), ford (2), karp (2), shortest (2), frank (2), cutting (2), successive (2), fletcher (2), conditions (2), convergence (2), unconstrained (2), heuristics (2), 1994 (2), geometry (2), advanced (2), stephen (2), wright (2), networks (2), online (2), com (2), yori (2), zwols (2), crc (2), 1998 (2), 98232 (2), efficiency (2), roos (2), 2006 (2), elementary (2), guide (2), chapter (2), mark (2), reading (2), vazirani (2), robert (2), todd (2), steiglitz (2), papadimitriou (2), written (2), featuring (2), 1999 (2), 1983 (2), comprehensive (2), reference (2), classical (2), murty (2), gondzio (2), 1996 (2), website (2), fukuda (2), komei (2), thomas (2), liebling (2), dominique (2), werra (2), eds (2), fresh (2), 2794181 (2), 1464775 (2), bf02614325 (2), 9373 (2), 369 (2), giles (2), submodular (2), studies (2), introducing (2), stochastic (2), business (2), borgwardt (2), 1287 (2), editor (2), collection (2), published (2), 1951 (2), allocation (2), 1941 (2), 224 (2), distribution (2), product (2), numerous (2), doklady (2), sssr (2), references (2), technique (2), machine (2), http (2), aaai (2), lehigh (2), edu (2), 2021 (2), december (2), lp_solve (2), 2023 (2), issn (2), 556 (2), versus (2), jiang (2), weinstein (2), inverse (2), cohen (2), sidford (2), pravin (2), fast (2), 30th (2), 1982 (2), 1109 (2), arithmetic (2), cvpr (2), narendra (2), britannica (2), 1905746 (2), 2307 (2), 2296111 (2), notes (2), term (2), shadow (2), subfield (2), oriented (2), fractional (2), squares (2), optimality (2), expected (2), shortfall (2), visual (2), block (2), works (2), xpress (2), suite (2), sas (2), algebraic (2), fortran (2), includes (2), sparse (2), sums (2), net (2), mosek (2), symbolic (2), math (2), addition (2), offers (2), guaranteed (2), allows (2), what (2), imsl (2), libraries (2), linearly (2), gurobi (2), popular (2), aimms (2), mpl (2), cplex (2), interface (2), environment (2), analytica (2), 500 (2), copyleft (2), column (2), generation (2), project (2), equations (2), formats (2), lgpl (2), gnu (2), milp (2), third (2), solves (2), sdp (2), socp (2), ojalgo (2), nlp (2), qcqp (2), jump (2), google (2), talk (2), heavily (2), towards (2), aspect (2), scripting (2), common (2), property (2), polymatroids (2), integrality (2), totally (2), unimodular (2), described (2), proven (2), size (2), concepts (2), central (2), polyhedral (2), hull (2), prove (2), relaxation (2), said (2), over (2), regions (2), techniques (2), structure (2), notably (2), unknown (2), even (2), ilp (2), unknowns (2), preserve (2), visit (2), bases (2), order (2), arrangement (2), family (2), named (2), moving (2), along (2), means (2), hirsch (2), conjecture (2), step (2), run (2), despite (2), determine (2), although (2), still (2), smale (2), allow (2), great (2), another (2), being (2), smaller (2), comparison (2), exponent (2), largest (2), same (2), times (2), taking (2), mathrm (2), nnz (2), sparsity (2), formally (2), bits (2), giving (2), his (2), finds (2), constructed (2), inspired (2), idea (2), decreasing (2), answer (2), learn (2), contained (2), iterations (2), before (2), ellipsoids (2), nonempty (2), tests (2), checks (2), ever (2), pivots (2), klee (2), minty (2), cube (2), hitting (2), thereby (2), equality (2), until (2), become (2), steps (2), usual (2), follows (2), attained (2), distinct (2), rays (2), reasons (2), cannot (2), existence (2), leftovers (2), equal (2), suppose (2), relaxations (2), bin (2), dualities (2), weak (2), details (2), alternative (2), formulation (2), amount (2), introduced (2), sales (2), planted (2), selling (2), three (2), single (2), widely (2), field (2), cases (2), management (2), costs (2), shown (2), came (2), independently (2), had (2), post (2), war (2), industries (2), american (2), economist (2), formulated (2), later (2), nobel (2), memorial (2), prize (2), wartime (2), became (2), fields (2), overlooked (2), late (2), 1930s (2), processes (2), manufacturing (2), fourier (2), here (2), whose (2), aligned (2), maximizes (2), red (2), appearance (2), upload (2), changes (2), read (2), english (2), norsk (2), log (2), create (2), donate (2), menu (2), mobile, cookie, statement, statistics, developers, conduct, legal, safety, contacts, disclaimers, site, you, agree, registered, trademark, organization, foundation, creative, attribution, sharealike, rendered, parsoid, edited, september, utc, hidden, module, annotated, webarchive, template, needing, viewpoints, errors, parameters, geometric, title, linear_programming, oldid, 1376807343, integer_unknowns, yale, lux, israel, czech, republic, japan, bnf, data, france, united, national, gnd, authority, control, databases, ncp, mcp, mlcp, lcp, tabu, spiral, simulated, annealing, parallel, hill, climbing, evolutionary, push, relabel, fulkerson, dinic, flows, floyd, warshall, dijkstra, spfa, bellman, kruskal, prim, borůvka, spanning, tree, greedy, paradigms, principal, scaling, subgradient, reduced, sequential, lagrangian, differentiable, penalty, barrier, computes, maxima, minima, hessians, truncated, dog, leg, levenberg, marquardt, mirror, gauss, conjugate, rank, sr1, davidon, bfgs, broyden, goldfarb, shanno, berndt, hausman, quasi, trust, gradients, parabolic, interpolation, nelder, mead, golden, benchmarks, faq, glossary, guidance, formulating, chapters, lectures, ziegler, günter, yinyu, siam, williams, fifth, 2013, building, diptesh, ghosh, 2010, 4419, 5512, action, exercises, appspot, 498, 71016, cornelis, jean, philippe, vial, mathematicians, scientists, gärtner, bernd, berlin, 30697, understanding, matoušek, jiří, mp1, 245, freeman, 7167, 1045, computers, intractability, completeness, david, johnson, garey, describes, randomized, berg, van, kreveld, marc, schwarzkopf, otfried, 2000, 2nd, 65620, overmars, dmitris, alevras, manfred, universitext, your, 65367, vijay, vanderbei, invited, survey, february, facets, 436, 6464735, s101070100261, 417, kenneth, corrected, republication, preface, dover, christos, carefully, odysseus, traveling, salesman, evar, nering, 1993, albert, tucker, xix, 482, approaches, 0720547, 09725, katta, jacek, lecture, 144, mcmaster, postscript, 1438311, jack, rick, min, relation, annals, 204, 7204, 0765, s0167, 5060, 70734, 185, benders, richard, cottle, books, california, selected, papers, average, karl, heinz, combinatorics, probabilistic, bland, 107, 3689647, moor, surveys, 339, 347, london, chapman, activity, physics, 230, localities, 1940, одном, эффективном, методе, решения, некоторых, классов, экстремальных, проблем, classes, extremal, 214, 211, akad, sci, approximate, subgame, perfect, repeated, games, ocs, aaai10, paper, viewfile, 1769, 2076, assembly, münster, ter, trans, zesch_hellingrath_2010_integrated, cor, command, interfaces, anstreicher, kurt, 561, 171894, 0030, 364x, opre, monotonic, build, illés, tibor, 170, s0377, 2217, 00061, 646, 3539, 140, european, operational, pros, cons, shunhua, omri, hengjie, 2020, 2004, 07470, qiuyi, conference, learning, colt, 1905, 04447, empirical, risk, 2018, 51st, acm, stoc, 1810, 07896, aaron, 1503, 01752, maintenance, speeding, 337, 8186, sfcs, 63499, 332, 28th, ieee, june, place, 123541868, 0883185, 0343, 6993, bf03025891, intelligencer, strang, gilbert, 1990, rule, 33463483, 1045573, bf01585729, gill, philip, murray, walter, margaret, 1991, addison, wesley, 376, 201, 12649, 112, somdeb, lahiri, grundmann, kwatra, essa, auto, directed, video, stabilization, robust, camera, paths, 232, 17707171, 4577, 0394, 5995525, 225, 7257867, bf02579150, 373, combinatorica, 1096, 1093, akademii, nauk, narain, xxvii, 35318475, oclc, 0387948333, 222, 221, april, 0167, 6377, 90043, letters, reminiscences, origins, definition, facts, 3rd, 1498710169, beijing, 125, 5218, 0422, 122, dynamics, perspectives, 1956, generalization, expanding, economy, 135, 115, econometrica, thompson, morgenstern, kemeny, 1945, 1945rves, bibcode, review, semidefinite, abstraction, ordered, matroid, strategies, success, odds, process, concept, lfp, periodicity, spectral, criterion, absolute, deviations, job, shop, quantitative, output, simulation, dynamical, diagram, vissim, mosel, derivative, optmodel, variety, vertical, aimed, markets, fully, integrated, multiple, packages, matrices, together, labview, group, capabilities, mathematica, wysiwyg, mathcad, base, intlinprog, linprog, toolbox, maple, conic, procedure, globally, sampling, integrate, monte, carlo, simulations, framework, within, spreadsheet, sbest, lingo, lindo, collections, nonlinearly, minimizations, fortmp, adjusted, spreadsheets, evaluations, recalculating, cells, openopt, opl, studio, tomlab, web, apmonitor, interactive, influence, diagrams, enable, users, formulate, nodes, objectives, selects, match, accepts, engines, plug, ins, artelys, knitro, student, commercial, licensed, exact, implemented, calls, appropriate, charge, proprietary, publicly, minto, graphics, incrementally, goal, qoca, own, custom, xli, translating, mps, kit, native, party, wrappers, specialist, bundles, translator, mathprog, glpk, coin, cpl, clp, incremental, toolkit, cassowary, reciprocal, sqp, suanshu, emphasis, compatible, zimpl, scip, bsd, pyomo, glop, gekko, permissive, please, relevant, discussion, improve, weighted, too, way, proving, show, lattice, generalized, somehow, assuming, previous, forcibly, terminology, consistent, throughout, literature, should, careful, distinguish, provide, alternate, characterization, specifically, nice, compact, conversely, desired, coordinates, observed, equivalently, confused, integrals, numbers, performed, calculus, antiderivative, discussed, extra, delayed, subclasses, right, sides, tdi, generally, situations, bip, arbitrary, classified, binary, studied, 1970s, essentially, attempt, small, allowing, possibility, without, resolving, fall, interested, knowing, subexponential, disproof, superpolynomial, variant, concern, suggests, significance, particularly, approach, determining, polynomially, lead, recently, disproved, higher, dimensions, leaves, closely, cited, among, 21st, century, words, yet, perhaps, gains, weakly, greatest, unit, strictly, represent, breakthroughs, potentially, major, our, ability, opinion, efficiencies, good, implementations, routine, sometimes, generated, significantly, typically, latter, running, roughly, multiply, followup, reproduce, remain, due, showed, denotes, represents, elements, remains, soft, notation, bigl, sqrt, bigr, speaking, claimed, claim, created, discovery, analyzed, traversing, landmark, establishing, solvability, break, specially, families, enclose, sequence, iteration, midpoint, tested, yes, enclosing, repeat, lower, translates, volumes, decrease, natively, programmes, finally, sought, obtained, remove, convert, equation, encoded, long, standing, issue, predecessors, arkadi, nemirovski, yudin, naum, shor, iterative, maintain, corners, perturbed, dimension, below, will, start, change, direct, route, variations, just, hold, therefore, updated, adjusting, respect, adding, stage, poor, class, quite, precautions, against, taken, cubic, cycling, constructing, walking, reached, sure, occurs, increase, rare, versions, actually, cycle, avoid, cycles, researchers, stalling, produces, shape, list, reason, choice, fewer, treat, unique, looking, subsets, continuum, underlies, boundary, alternatively, constant, everywhere, inconsistent, instance, satisfied, jointly, geometrically, define, similarly, necessary, condition, conveys, fairly, maximizing, quantities, negativity, requirement, scarce, supplies, respective, obtain, coloring, commonly, arise, dominating, rectangle, pairs, tells, understood, formed, hope, obtaining, nonnegative, reversed, whence, require, tight, strong, asymmetric, referred, provides, express, representing, above, newly, introduces, replace, plant, plus, piece, farm, either, per, respectively, choosing, hectares, graphical, shading, violating, unshaded, dashed, farthest, origin, gives, lying, involving, rewritten, mathbb, usually, intuitive, describing, consists, parts, monograph, entitled, considered, enough, specialized, sub, historically, ideas, generalizations, early, formation, currently, utilized, company, technology, modern, issues, changing, companies, stabilize, youtube, videos, profits, microeconomics, convexity, multicommodity, larger, breakthrough, people, jobs, power, test, permutations, select, vast, configurations, exceeds, moment, posing, applying, behind, drastically, reduces, checked, observable, universe, particles, 1946, air, force, invented, tackled, arranged, meeting, discuss, immediately, conjectured, realizing, provided, formal, proof, unpublished, report, january, 1948, public, years, daily, initially, neglected, dutch, shared, 1975, gave, very, died, 1957, awarded, posthumously, lauren, sciences, ussr, initial, obscurity, successes, propelled, spotlight, wwii, gained, widespread, recognition, cornerstone, contributions, eventually, foundational, broader, acceptance, utilization, making, turning, during, world, emerged, vital, extensive, addressing, complex, challenges, logistics, invaluable, considering, critical, availability, soviet, mathematician, delved, focused, schedules, explored, groundbreaking, largely, decades, wassily, dates, back, far, who, 1827, them, whom, motzkin, elimination, lesser, extent, engineering, close, connection, eigenequations, energy, telecommunications, useful, diverse, design, routing, components, determined, specify, optimized, mapsto, finitely, valued, smallest, spaces, achieve, outcome, lowest, requirements, represented, relationships, closed, surfaces, fixed, highest, planes, pictorial, six, depicted, yellow, dimensional, intersects, arrow, indicates, retronym, referring, television, broadcasting, broadcast, redirected, encyclopedia, item, wikiquote, projects, printable, download, print, export, switch, legacy, parser, get, shortened, url, permanent, actions, tiếng, việt, اردو, українська, türkçe, ไทย, svenska, српски, srpski, shqip, slovenščina, srpskohrvatski, српскохрватски, sicilianu, русский, română, português, polski, bokmål, nynorsk, nederlands, മലയാളം, 한국어, қазақша, 日本語, italiano, bahasa, indonesia, հայերեն, magyar, हिन्दी


Text of the page (random words):
việt 粵語 中文 edit links article talk english read edit view history tools tools move to sidebar hide actions read edit view history general what links here related changes upload file permanent link page information cite this page get shortened url switch to legacy parser print export download as pdf printable version in other projects wikimedia commons wikiquote wikidata item appearance move to sidebar hide from wikipedia the free encyclopedia redirected from mixed integer programming method to solve optimization problems for the retronym referring to television broadcasting see broadcast programming a pictorial representation of a simple linear program with two variables and six inequalities the set of feasible solutions is depicted in yellow and forms a polygon a 2 dimensional polytope the optimum of the linear cost function is where the red line intersects the polygon the red line is a level set of the cost function and the arrow indicates the direction in which we are optimizing a closed feasible region of a problem with three variables is a convex polyhedron the surfaces giving a fixed value of the objective function are planes not shown the linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value linear programming lp also called linear optimization is a method to achieve the best outcome such as maximum profit or lowest cost in a mathematical model whose requirements and objective are represented by linear relationships linear programming is a special case of mathematical programming also known as mathematical optimization more formally linear programming is a technique for the optimization of a linear objective function subject to linear equality and linear inequality constraints its feasible region is a convex polytope which is a set defined as the intersection of finitely many half spaces each of which is defined by a linear inequality its objective function is a real valued affine linear function defined on this polytope a linear programming algorithm finds a point in the polytope where this function has the largest or smallest value if such a point exists linear programs are problems that can be expressed in standard form as find a vector x that maximizes c t x subject to a x b and x 0 displaystyle begin aligned text find a vector mathbf x text that maximizes mathbf c mathsf t mathbf x text subject to a mathbf x leq mathbf b text and mathbf x geq mathbf 0 end aligned here the components of x displaystyle mathbf x are the variables to be determined c displaystyle mathbf c and b displaystyle mathbf b are given vectors and a displaystyle a is a given matrix the function whose value is to be maximized x c t x displaystyle mathbf x mapsto mathbf c mathsf t mathbf x in this case is called the objective function the constraints a x b displaystyle a mathbf x leq mathbf b and x 0 displaystyle mathbf x geq mathbf 0 specify a convex polytope over which the objective function is to be optimized linear programming can be applied to various fields of study it is widely used in mathematics and to a lesser extent in business economics and some engineering problems there is a close connection between linear programs eigenequations john von neumann s general equilibrium model and structural equilibrium models see dual linear program for details 1 2 3 industries that use linear programming models include transportation energy telecommunications and manufacturing it has proven useful in modeling diverse types of problems in planning routing scheduling assignment and design history edit leonid kantorovich john von neumann the problem of solving a system of linear inequalities dates back at least as far as fourier who in 1827 published a method for solving them 4 and after whom the method of fourier motzkin elimination is named in the late 1930s soviet mathematician leonid kantorovich and american economist wassily leontief independently delved into the practical applications of linear programming kantorovich focused on manufacturing schedules while leontief explored economic applications their groundbreaking work was largely overlooked for decades the turning point came during world war ii when linear programming emerged as a vital tool it found extensive use in addressing complex wartime challenges including transportation logistics scheduling and resource allocation linear programming proved invaluable in optimizing these processes while considering critical constraints such as costs and resource availability despite its initial obscurity the wartime successes propelled linear programming into the spotlight post wwii the method gained widespread recognition and became a cornerstone in various fields from operations research to economics the overlooked contributions of kantorovich and leontief in the late 1930s eventually became foundational to the broader acceptance and utilization of linear programming in optimizing decision making processes 5 kantorovich s work was initially neglected in the ussr 6 about the same time as kantorovich the dutch american economist t c koopmans formulated classical economic problems as linear programs kantorovich and koopmans later shared the 1975 nobel memorial prize in economic sciences 4 in 1941 frank lauren hitchcock also formulated transportation problems as linear programs and gave a solution very similar to the later simplex method 7 hitchcock had died in 1957 and the nobel memorial prize is not awarded posthumously from 1946 to 1947 george b dantzig independently developed general linear programming formulation to use for planning problems in the us air force 8 in 1947 dantzig also invented the simplex method that for the first time efficiently tackled the linear programming problem in most cases 8 when dantzig arranged a meeting with john von neumann to discuss his simplex method von neumann immediately conjectured the theory of duality by realizing that the problem he had been working in game theory was equivalent 8 dantzig provided formal proof in an unpublished report a theorem on linear inequalities on january 5 1948 6 dantzig s work was made available to public in 1951 in the post war years many industries applied it in their daily planning dantzig s original example was to find the best assignment of 70 people to 70 jobs the computing power required to test all the permutations to select the best assignment is vast the number of possible configurations exceeds the number of particles in the observable universe however it takes only a moment to find the optimum solution by posing the problem as a linear program and applying the simplex algorithm the theory behind linear programming drastically reduces the number of possible solutions that must be checked the linear programming problem was first shown to be solvable in polynomial time by leonid khachiyan in 1979 9 but a larger theoretical and practical breakthrough in the field came in 1984 when narendra karmarkar introduced a new interior point method for solving linear programming problems 10 uses edit linear programming is a widely used field of optimization for several reasons many practical problems in operations research can be expressed as linear programming problems 6 certain special cases of linear programming such as network flow problems and multicommodity flow problems are considered important enough to have much research on specialized algorithms a number of algorithms for other types of optimization problems work by solving linear programming problems as sub problems historically ideas from linear programming have inspired many of the central concepts of optimization theory such as duality decomposition and the importance of convexity and its generalizations likewise linear programming was heavily used in the early formation of microeconomics and it is currently utilized in company management such as planning production transportation and technology although the modern management issues are ever changing most companies would like to maximize profits and minimize costs with limited resources google also uses linear programming to stabilize youtube videos 11 representation of the problem of finding the minimum of a finite number of linear programming maximization problems as a single linear programming problem is well known representation of the problem of finding the maximum of a finite number of linear programming maximization problems as a single linear programming problem is available in topic 2 of section 1 of a monograph entitled some topics in linear programming and bi matrix game theory 12 standard form edit standard form is the usual and most intuitive form of describing a linear programming problem it consists of the following three parts a linear or affine function to be maximized e g f x 1 x 2 c 1 x 1 c 2 x 2 displaystyle f x_ 1 x_ 2 c_ 1 x_ 1 c_ 2 x_ 2 problem constraints of the following form e g a 11 x 1 a 12 x 2 b 1 a 21 x 1 a 22 x 2 b 2 a 31 x 1 a 32 x 2 b 3 displaystyle begin matrix a_ 11 x_ 1 a_ 12 x_ 2 leq b_ 1 a_ 21 x_ 1 a_ 22 x_ 2 leq b_ 2 a_ 31 x_ 1 a_ 32 x_ 2 leq b_ 3 end matrix non negative variables e g x 1 0 x 2 0 displaystyle begin matrix x_ 1 geq 0 x_ 2 geq 0 end matrix the problem is usually expressed in matrix form and then becomes max c t x x r n a x b x 0 displaystyle max mathbf c mathsf t mathbf x mid mathbf x in mathbb r n land a mathbf x leq mathbf b land mathbf x geq 0 other forms such as minimization problems problems with constraints on alternative forms and problems involving negative variables can always be rewritten into an equivalent problem in standard form example edit graphical solution to the farmer example after shading regions violating the conditions the vertex of the unshaded region with the dashed line farthest from the origin gives the optimal combination its lying on the land and pesticide lines implies that revenue is limited by land and pesticide not fertilizer suppose that a farmer has a piece of farm land say l hectares to be planted with either wheat or barley or some combination of the two the farmer has f kilograms of fertilizer and p kilograms of pesticide every hectare of wheat requires f 1 kilograms of fertilizer and p 1 kilograms of pesticide while every hectare of barley requires f 2 kilograms of fertilizer and p 2 kilograms of pesticide let s 1 be the selling price of wheat and s 2 be the selling price of barley per hectare if we denote the area of land planted with wheat and barley by x 1 and x 2 respectively then profit can be maximized by choosing optimal values for x 1 and x 2 this problem can be expressed with the following linear programming problem in the standard form maximize s 1 x 1 s 2 x 2 displaystyle s_ 1 cdot x_ 1 s_ 2 cdot x_ 2 maximize the revenue the total wheat sales plus the total barley sales revenue is the objective function subject to x 1 x 2 l displaystyle x_ 1 x_ 2 leq l limit on total area f 1 x 1 f 2 x 2 f displaystyle f_ 1 cdot x_ 1 f_ 2 cdot x_ 2 leq f limit on fertilizer p 1 x 1 p 2 x 2 p displaystyle p_ 1 cdot x_ 1 p_ 2 cdot x_ 2 leq p limit on pesticide x 1 0 x 2 0 displaystyle x_ 1 geq 0 x_ 2 geq 0 cannot plant a negative area in matrix form this becomes maximize s 1 s 2 x 1 x 2 displaystyle begin bmatrix s_ 1 s_ 2 end bmatrix begin bmatrix x_ 1 x_ 2 end bmatrix subject to 1 1 f 1 f 2 p 1 p 2 x 1 x 2 l f p x 1 x 2 0 0 displaystyle begin bmatrix 1 1 f_ 1 f_ 2 p_ 1 p_ 2 end bmatrix begin bmatrix x_ 1 x_ 2 end bmatrix leq begin bmatrix l f p end bmatrix begin bmatrix x_ 1 x_ 2 end bmatrix geq begin bmatrix 0 0 end bmatrix augmented form slack form edit linear programming problems can be converted into an augmented form in order to apply the common form of the simplex algorithm this form introduces non negative slack variables to replace inequalities with equalities in the constraints the problems can then be written in the following block matrix form maximize z displaystyle z 1 c t 0 t 0 a i z x s 0 b displaystyle begin bmatrix 1 mathbf c mathsf t mathbf 0 mathsf t mathbf 0 mathbf a mathbf i end bmatrix begin bmatrix z mathbf x mathbf s end bmatrix begin bmatrix 0 mathbf b end bmatrix x 0 s 0 displaystyle mathbf x geq mathbf 0 mathbf s geq mathbf 0 where s displaystyle mathbf s are the newly introduced slack variables x displaystyle mathbf x are the decision variables and z displaystyle z is the variable to be maximized example edit the example above is converted into the following augmented form maximize s 1 x 1 s 2 x 2 displaystyle s_ 1 cdot x_ 1 s_ 2 cdot x_ 2 objective function subject to x 1 x 2 x 3 l displaystyle x_ 1 x_ 2 x_ 3 l augmented constraint f 1 x 1 f 2 x 2 x 4 f displaystyle f_ 1 cdot x_ 1 f_ 2 cdot x_ 2 x_ 4 f augmented constraint p 1 x 1 p 2 x 2 x 5 p displaystyle p_ 1 cdot x_ 1 p_ 2 cdot x_ 2 x_ 5 p augmented constraint x 1 x 2 x 3 x 4 x 5 0 displaystyle x_ 1 x_ 2 x_ 3 x_ 4 x_ 5 geq 0 where x 3 x 4 x 5 displaystyle x_ 3 x_ 4 x_ 5 are non negative slack variables representing in this example the unused area the amount of unused fertilizer and the amount of unused pesticide in matrix form this becomes maximize z displaystyle z 1 s 1 s 2 0 0 0 0 1 1 1 0 0 0 f 1 f 2 0 1 0 0 p 1 p 2 0 0 1 z x 1 x 2 x 3 x 4 x 5 0 l f p x 1 x 2 x 3 x 4 x 5 0 displaystyle begin bmatrix 1 s_ 1 s_ 2 0 0 0 0 1 1 1 0 0 0 f_ 1 f_ 2 0 1 0 0 p_ 1 p_ 2 0 0 1 end bmatrix begin bmatrix z x_ 1 x_ 2 x_ 3 x_ 4 x_ 5 end bmatrix begin bmatrix 0 l f p end bmatrix begin bmatrix x_ 1 x_ 2 x_ 3 x_ 4 x_ 5 end bmatrix geq 0 duality edit main article dual linear program every linear programming problem referred to as a primal problem can be converted into a dual problem which provides an upper bound to the optimal value of the primal problem in matrix form we can express the primal problem as maximize c t x subject to a x b x 0 with the corresponding symmetric dual problem minimize b t y subject to a t y c y 0 an alternative primal formulation is maximize c t x subject to a x b with the corresponding asymmetric dual problem minimize b t y subject to a t y c y 0 a fundamental idea of duality theory is the fact that for the symmetric dual the dual of a dual linear program is the original primal linear program the dual variables y displaystyle mathbf y may be understood as coefficients in a linear combination of inequalities from the primal problem formed in the hope of obtaining a bound on the objective function such coefficients need to be nonnegative since otherwise inequalities would become reversed whence we require y 0 displaystyle mathbf y geq mathbf 0 if in addition c y a displaystyle mathbf c top leq mathbf y top a then it follows that c x y a x y b b y displaystyle mathbf c top mathbf x leq mathbf y top a mathbf x leq mathbf y top mathbf b mathbf b top mathbf y text i e the value of the dual objective function b y displaystyle mathbf b top mathbf y at any feasible dual point y displaystyle mathbf y is an upper bound on the value of the primal objective function c x displaystyle ma...
Thumbnail images (randomly selected): * Images may be subject to copyright.GREEN status (no comments)
  • Wikipedia
  • The Free Encyclopedia
  • \displaystyle \begin al...
  • \displaystyle \mathbf x...
  • \displaystyle \mathbf c...
  • \displaystyle \mathbf b...
  • \displaystyle A
  • \displaystyle \mathbf x...
  • \displaystyle A\mathbf ...
  • \displaystyle \mathbf x...
  • \displaystyle f(x_ 1 ,x_...
  • \displaystyle \begin ma...
  • \displaystyle \begin ma...
  • \displaystyle \max\ \,\m...
  • \displaystyle S_ 1 \cdot...
  • \displaystyle x_ 1 +x_ 2...
  • \displaystyle F_ 1 \cdot...
  • \displaystyle P_ 1 \cdot...
  • \displaystyle x_ 1 \geq ...
  • \displaystyle \begin bm...
  • \displaystyle \begin bm...
  • \displaystyle z
  • \displaystyle \begin bm...
  • \displaystyle \mathbf x...
  • \displaystyle \mathbf s...
  • \displaystyle x_ 1 +x_ 2...
  • \displaystyle F_ 1 \cdot...
  • \displaystyle P_ 1 \cdot...
  • \displaystyle x_ 1 ,x_ 2...
  • \displaystyle x_ 3 ,x_ 4...
  • \displaystyle \begin bm...
  • \displaystyle \mathbf y...
  • \displaystyle \mathbf y...
  • \displaystyle \mathbf c...
  • \displaystyle \mathbf c...
  • \displaystyle \mathbf b...
  • \displaystyle \mathbf c...
  • \displaystyle O(n^ 6 L)
  • \displaystyle A\mathbf ...
  • \displaystyle A^ \top \...
  • \displaystyle \mathbf x...
  • \displaystyle O(n^ 3.5 L...
  • \displaystyle O(n^ 3 )
  • \displaystyle O(n^ 2.5 )...
  • \displaystyle O((n+d)^ 1...
  • \displaystyle d
  • \displaystyle n
  • \displaystyle L
  • \displaystyle \tilde O...
  • \displaystyle \tilde O...
  • \displaystyle \mathrm n...
  • \displaystyle O(n^ 2.5 L...
  • \displaystyle \tilde O...
  • \displaystyle \omega
  • \displaystyle \alpha
  • \displaystyle n\times n
  • \displaystyle n\times n^...
  • \displaystyle O(n^ 2 )
  • \displaystyle \tilde O...
  • \displaystyle \omega =2
  • \displaystyle \alpha =1
  • \displaystyle \tilde O...
  • \displaystyle P=\ x\mid ...
  • \displaystyle \ \max cx\...
  • \displaystyle x^ *
  • \displaystyle P
  • \displaystyle O (((m+n)...
  • Wikimedia Foundation
  • Powered by MediaWiki

Verified site has: 442 subpage(s). Do you want to verify them? Verify pages:

1-5 6-10 11-15 16-20 21-25 26-30 31-35 36-40 41-45 46-50
51-55 56-60 61-65 66-70 71-75 76-80 81-85 86-90 91-95 96-100
101-105 106-110 111-115 116-120 121-125 126-130 131-135 136-140 141-145 146-150
151-155 156-160 161-165 166-170 171-175 176-180 181-185 186-190 191-195 196-200
201-205 206-210 211-215 216-220 221-225 226-230 231-235 236-240 241-245 246-250
251-255 256-260 261-265 266-270 271-275 276-280 281-285 286-290 291-295 296-300
301-305 306-310 311-315 316-320 321-325 326-330 331-335 336-340 341-345 346-350
351-355 356-360 361-365 366-370 371-375 376-380 381-385 386-390 391-395 396-400
401-405 406-410 411-415 416-420 421-425 426-430 431-435 436-440 441-442


The site also has references to the 51 subdomain(s)

  en.wikipedia.org  Verify   af.wikipedia.org  Verify   ar.wikipedia.org  Verify
  ast.wikipedia.org  Verify   az.wikipedia.org  Verify   be.wikipedia.org  Verify
  bn.wikipedia.org  Verify   bs.wikipedia.org  Verify   ca.wikipedia.org  Verify
  ckb.wikipedia.org  Verify   cs.wikipedia.org  Verify   cv.wikipedia.org  Verify
  de.wikipedia.org  Verify   el.wikipedia.org  Verify   es.wikipedia.org  Verify
  et.wikipedia.org  Verify   eu.wikipedia.org  Verify   fa.wikipedia.org  Verify
  fr.wikipedia.org  Verify   gl.wikipedia.org  Verify   he.wikipedia.org  Verify
  hi.wikipedia.org  Verify   hu.wikipedia.org  Verify   hy.wikipedia.org  Verify
  id.wikipedia.org  Verify   it.wikipedia.org  Verify   ja.wikipedia.org  Verify
  kk.wikipedia.org  Verify   ko.wikipedia.org  Verify   ml.wikipedia.org  Verify
  nl.wikipedia.org  Verify   nn.wikipedia.org  Verify   no.wikipedia.org  Verify
  pl.wikipedia.org  Verify   pt.wikipedia.org  Verify   ro.wikipedia.org  Verify
  ru.wikipedia.org  Verify   scn.wikipedia.org  Verify   sh.wikipedia.org  Verify
  simple.wikipedia.org  Verify   sl.wikipedia.org  Verify   sq.wikipedia.org  Verify
  sr.wikipedia.org  Verify   sv.wikipedia.org  Verify   th.wikipedia.org  Verify
  tr.wikipedia.org  Verify   uk.wikipedia.org  Verify   ur.wikipedia.org  Verify
  vi.wikipedia.org  Verify   zh-yue.wikipedia.org  Verify   zh.wikipedia.org  Verify


Top 50 hastags from of all verified websites.

Supplementary Information (add-on for SEO geeks)*- See more on header.verify-www.com

Header

HTTP/1.1 301 Moved Permanently
content-length 0
location htt????/en.wikipedia.org/wiki/Mixed_integer_programming
server HAProxy
x-cache cp6011 int
x-cache-status int-tls
connection close
HTTP/2 200
date Sun, 04 Oct 2026 02:28:09 GMT
server mw-web.eqiad.main-75d67bc6d9-sbf7d
x-content-type-options nosniff
content-language en
accept-ch
reporting-endpoints csp-report-to-endpoint= /w/api.php?action=cspreport&format=json ;
content-security-policy script-src unsafe-eval blob: self meta.wikimedia.org *.wikimedia.org *.wikipedia.org *.wikinews.org *.wiktionary.org *.wikibooks.org *.wikiversity.org *.wikisource.org wikisource.org *.wikiquote.org *.wikidata.org *.wikifunctions.org *.wikivoyage.org *.mediawiki.org mediawiki.org wikimedia.org *.wmflabs.org *.wmcloud.org *.toolforge.org wss://*.toolforge.org *.jsdelivr.net unpkg.com cdnjs.cloudflare.com raw.githubusercontent.com *.github.com code.jquery.com cdn.mathjax.org use.typekit.net fonts.cdnfonts.com use.fontawesome.com i.ytimg.com rsms.me doi.org localhost htt????/localhost:* htt???/localhost:* wss://localhost:* ws://localhost:* *.google.com *.gstatic.com *.googleapis.com *.translate.yandex.net yastatic.net ya.ru radically.github.io cdn.sammdot.ca cdn.fontshare.com viaf.org publicai-proxy.alaexis.workers.dev iiif.archive.org api.flickr.com live.staticflickr.com api.anthropic.com api.openai.com api.publicai.co catalogo.pusc.it parsifal.urbe.it opac.sbn.it overpass-api.de api.openrouteservice.org archive.org *.openstreetmap.org *.waymarkedtrails.org *.thunderforest.com registry.ipe.wiki analytics.ipe.wiki qlever.dev app.goacoustic.com wikipedia-archive.ourworldindata.org api.inaturalist.org inaturalist-open-data.s3.amazonaws.com validator.w3.org db.onlinewebfonts.com fontlibrary.org unsafe-inline auth.wikimedia.org; default-src self data: blob: upload.wikimedia.org thumb.wikimedia.org htt????/commons.wikimedia.org meta.wikimedia.org *.wikimedia.org *.wikipedia.org *.wikinews.org *.wiktionary.org *.wikibooks.org *.wikiversity.org *.wikisource.org wikisource.org *.wikiquote.org *.wikidata.org *.wikifunctions.org *.wikivoyage.org *.mediawiki.org mediawiki.org wikimedia.org *.wmflabs.org *.wmcloud.org *.toolforge.org wss://*.toolforge.org *.jsdelivr.net unpkg.com cdnjs.cloudflare.com raw.githubusercontent.com *.github.com code.jquery.com cdn.mathjax.org use.typekit.net fonts.cdnfonts.com use.fontawesome.com i.ytimg.com rsms.me doi.org localhost htt????/localhost:* htt???/localhost:* wss://localhost:* ws://localhost:* *.google.com *.gstatic.com *.googleapis.com *.translate.yandex.net yastatic.net ya.ru radically.github.io cdn.sammdot.ca cdn.fontshare.com viaf.org publicai-proxy.alaexis.workers.dev iiif.archive.org api.flickr.com live.staticflickr.com api.anthropic.com api.openai.com api.publicai.co catalogo.pusc.it parsifal.urbe.it opac.sbn.it overpass-api.de api.openrouteservice.org archive.org *.openstreetmap.org *.waymarkedtrails.org *.thunderforest.com registry.ipe.wiki analytics.ipe.wiki qlever.dev app.goacoustic.com wikipedia-archive.ourworldindata.org api.inaturalist.org inaturalist-open-data.s3.amazonaws.com validator.w3.org db.onlinewebfonts.com fontlibrary.org en.wikibooks.org en.wikinews.org en.wikiquote.org en.wikisource.org en.wikiversity.org en.wikivoyage.org en.wiktionary.org www.mediawiki.org commons.wikimedia.org foundation.wikimedia.org incubator.wikimedia.org species.wikimedia.org wikimania.wikimedia.org www.wikidata.org www.wikifunctions.org auth.wikimedia.org; style-src self data: blob: upload.wikimedia.org thumb.wikimedia.org htt????/commons.wikimedia.org meta.wikimedia.org *.wikimedia.org *.wikipedia.org *.wikinews.org *.wiktionary.org *.wikibooks.org *.wikiversity.org *.wikisource.org wikisource.org *.wikiquote.org *.wikidata.org *.wikifunctions.org *.wikivoyage.org *.mediawiki.org mediawiki.org wikimedia.org *.wmflabs.org *.wmcloud.org *.toolforge.org wss://*.toolforge.org *.jsdelivr.net unpkg.com cdnjs.cloudflare.com raw.githubusercontent.com *.github.com code.jquery.com cdn.mathjax.org use.typekit.net fonts.cdnfonts.com use.fontawesome.com i.ytimg.com rsms.me doi.org localhost htt????/localhost:* htt???/localhost:* wss://localhost:* ws://localhost:* *.google.com *.gstatic.com *.googleapis.com *.translate.yandex.net yastatic.net ya.ru radically.github.io cdn.sammdot.ca cdn.fontshare.com viaf.org publicai-proxy.alaexis.workers.dev iiif.archive.org api.flickr.com live.staticflickr.com api.anthropic.com api.openai.com api.publicai.co catalogo.pusc.it parsifal.urbe.it opac.sbn.it overpass-api.de api.openrouteservice.org archive.org *.openstreetmap.org *.waymarkedtrails.org *.thunderforest.com registry.ipe.wiki analytics.ipe.wiki qlever.dev app.goacoustic.com wikipedia-archive.ourworldindata.org api.inaturalist.org inaturalist-open-data.s3.amazonaws.com validator.w3.org db.onlinewebfonts.com fontlibrary.org unsafe-inline ; object-src none ; report-uri /w/api.php?action=cspreport&format=json; report-to csp-report-to-endpoint
last-modified Wed, 30 Sep 2026 16:25:28 GMT
content-type text/html; charset=UTF-8
content-encoding gzip
age 0
accept-ranges bytes
x-cache cp6015 miss, cp6009 miss
x-cache-status miss
strict-transport-security max-age=106384710; includeSubDomains; preload
report-to group : wm_nel , max_age : 604800, endpoints : [ url : htt????/intake-logging.wikimedia.org/v1/events?stream=w3c.reportingapi.network_error&schema_uri=/w3c/reportingapi/network_error/1.0.0 ]
nel report_to : wm_nel , max_age : 604800, failure_fraction : 0.05, success_fraction : 0.0
set-cookie WMF-Last-Access=04-Oct-2026;Path=/;HttpOnly;secure;Expires=Thu, 05 Nov 2026 00:00:00 GMT
set-cookie WMF-Last-Access-Global=04-Oct-2026;Path=/;Domain=.wikipedia.org;HttpOnly;secure;Expires=Thu, 05 Nov 2026 00:00:00 GMT
set-cookie WMF-DP=ecf;Path=/;HttpOnly;secure;Expires=Sun, 04 Oct 2026 00:00:00 GMT
x-client-ip 5.135.42.194
cache-control private, s-maxage=0, max-age=0, must-revalidate, no-transform
vary Accept-Encoding,X-Subdomain,Cookie,Authorization,User-Agent
set-cookie GeoIP=FR:::48.86:2.34:v4; Path=/; secure; Domain=.wikipedia.org
set-cookie NetworkProbeLimit=0.001;Path=/;Secure;SameSite=None;Max-Age=3600
set-cookie WMF-Uniq=3jXRTDecGEXKEQeEtNBZKwPvAAAAAFvdepjG7CqEv5puDc0NjL4bszlv-D39UOyt;Domain=.wikipedia.org;Path=/;HttpOnly;secure;SameSite=None;Expires=Mon, 04 Oct 2027 00:00:00 GMT
x-request-id 9c44f1ba-3abd-4960-a748-8a1a35b231e3
x-analytics
server-timing cache;desc= miss , host;desc= cp6009 ,co_id;desc= 181975402

Meta Tags

title="Linear programming - Wikipedia"
charset="UTF-8"
name="ResourceLoaderDynamicStyles" content=""
name="generator" content="MediaWiki 1.47.0-wmf.22"
name="referrer" content="origin"
name="referrer" content="origin-when-cross-origin"
name="robots" content="max-image-preview:standard"
name="format-detection" content="telephone=no"
property="og:image" content="htt????/thumb.wikimedia.org/wikipedia/commons/thumb/7/70/Linear_optimization_in_a_2-dimensional_polytope.svg/1280px-Linear_optimization_in_a_2-dimensional_polytope.svg.png?utm_source=en.wikipedia.org&utm_campaign=index&utm_content=thumbnail"
property="og:image:width" content="1200"
property="og:image:height" content="1168"
name="viewport" content="width=1120"
property="og:title" content="Linear programming - Wikipedia"
property="og:type" content="website"
property="mw:PageProp/toc" id="mwTQ" data-mw='{"autoGenerated":true}'

Load Info

page size543979
load time (s)0.720108
redirect count1
speed download124940
server IP 185.15.58.224
* all occurrences of the string "http://" have been changed to "htt???/"